/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/mix039_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:07:21,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:07:21,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:07:21,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:07:21,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:07:21,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:07:21,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:07:21,717 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:07:21,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:07:21,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:07:21,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:07:21,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:07:21,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:07:21,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:07:21,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:07:21,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:07:21,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:07:21,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:07:21,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:07:21,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:07:21,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:07:21,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:07:21,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:07:21,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:07:21,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:07:21,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:07:21,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:07:21,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:07:21,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:07:21,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:07:21,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:07:21,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:07:21,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:07:21,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:07:21,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:07:21,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:07:21,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:07:21,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:07:21,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:07:21,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:07:21,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:07:21,738 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 10:07:21,751 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:07:21,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:07:21,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:07:21,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:07:21,753 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:07:21,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:07:21,753 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:07:21,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:07:21,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:07:21,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:07:21,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:07:21,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:07:21,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:07:21,754 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:07:21,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:07:21,754 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:07:21,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:07:21,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:07:21,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:07:21,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:07:21,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:07:21,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:07:21,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:07:21,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:07:21,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:07:21,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:07:21,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:07:21,755 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:07:21,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:07:21,755 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:07:21,755 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 10:07:21,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:07:21,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:07:21,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:07:21,978 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:07:21,978 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:07:21,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_power.oepc.i [2021-03-26 10:07:22,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9e2c85a/067ebc8f96bf4cc78e73ace739bc9b47/FLAG9c1befab5 [2021-03-26 10:07:22,450 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:07:22,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_power.oepc.i [2021-03-26 10:07:22,460 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9e2c85a/067ebc8f96bf4cc78e73ace739bc9b47/FLAG9c1befab5 [2021-03-26 10:07:22,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9e2c85a/067ebc8f96bf4cc78e73ace739bc9b47 [2021-03-26 10:07:22,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:07:22,470 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:07:22,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:07:22,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:07:22,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:07:22,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:22,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5607b28b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22, skipping insertion in model container [2021-03-26 10:07:22,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:22,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:07:22,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:07:22,641 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/mix039_power.oepc.i[951,964] [2021-03-26 10:07:22,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:07:22,816 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:07:22,825 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/mix039_power.oepc.i[951,964] [2021-03-26 10:07:22,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:07:22,902 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:07:22,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22 WrapperNode [2021-03-26 10:07:22,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:07:22,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:07:22,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:07:22,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:07:22,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:22,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:22,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:07:22,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:07:22,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:07:22,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:07:22,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:22,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:22,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:22,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:22,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:22,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:22,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (1/1) ... [2021-03-26 10:07:23,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:07:23,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:07:23,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:07:23,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:07:23,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (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 10:07:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:07:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:07:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:07:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:07:23,065 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:07:23,065 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:07:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:07:23,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:07:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:07:23,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:07:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:07:23,066 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:07:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:07:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:07:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:07:23,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:07:23,068 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 10:07:24,302 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:07:24,302 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:07:24,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:07:24 BoogieIcfgContainer [2021-03-26 10:07:24,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:07:24,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:07:24,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:07:24,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:07:24,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:07:22" (1/3) ... [2021-03-26 10:07:24,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfd1778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:07:24, skipping insertion in model container [2021-03-26 10:07:24,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:07:22" (2/3) ... [2021-03-26 10:07:24,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfd1778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:07:24, skipping insertion in model container [2021-03-26 10:07:24,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:07:24" (3/3) ... [2021-03-26 10:07:24,308 INFO L111 eAbstractionObserver]: Analyzing ICFG mix039_power.oepc.i [2021-03-26 10:07:24,312 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:07:24,314 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:07:24,315 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:07:24,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,340 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,340 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,341 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,341 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,341 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,341 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,341 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,341 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,346 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,346 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,349 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,350 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,351 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,352 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,353 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,357 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,358 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,360 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,360 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,360 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,361 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,362 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:07:24,369 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:07:24,381 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:07:24,400 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:07:24,400 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:07:24,400 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:07:24,400 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:07:24,400 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:07:24,400 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:07:24,400 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:07:24,400 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:07:24,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 10:07:24,446 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 10:07:24,447 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:24,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 10:07:24,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 10:07:24,458 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-26 10:07:24,459 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:24,467 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 10:07:24,470 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 10:07:24,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-26 10:07:24,495 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 10:07:24,495 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:24,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 10:07:24,497 INFO L142 LiptonReduction]: Number of co-enabled transitions 2876 [2021-03-26 10:07:25,604 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:07:25,965 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:07:26,075 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:07:27,329 INFO L154 LiptonReduction]: Checked pairs total: 5194 [2021-03-26 10:07:27,330 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-26 10:07:27,331 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2872 [2021-03-26 10:07:27,337 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-26 10:07:27,337 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:27,337 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:27,337 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:27,337 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:27,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1584989629, now seen corresponding path program 1 times [2021-03-26 10:07:27,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:27,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105871963] [2021-03-26 10:07:27,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:27,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:27,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:27,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:27,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:27,524 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 10:07:27,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105871963] [2021-03-26 10:07:27,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:27,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:07:27,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782208795] [2021-03-26 10:07:27,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:07:27,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:27,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:07:27,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:07:27,539 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 196 [2021-03-26 10:07:27,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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 10:07:27,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:27,542 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 196 [2021-03-26 10:07:27,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:27,641 INFO L129 PetriNetUnfolder]: 133/384 cut-off events. [2021-03-26 10:07:27,641 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:27,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 384 events. 133/384 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2174 event pairs, 110 based on Foata normal form. 32/387 useless extension candidates. Maximal degree in co-relation 581. Up to 153 conditions per place. [2021-03-26 10:07:27,648 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 11 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-26 10:07:27,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 140 flow [2021-03-26 10:07:27,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:07:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:07:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2021-03-26 10:07:27,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9149659863945578 [2021-03-26 10:07:27,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 538 transitions. [2021-03-26 10:07:27,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 538 transitions. [2021-03-26 10:07:27,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:27,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 538 transitions. [2021-03-26 10:07:27,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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 10:07:27,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 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 10:07:27,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 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 10:07:27,677 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 538 transitions. [2021-03-26 10:07:27,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 140 flow [2021-03-26 10:07:27,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:07:27,682 INFO L241 Difference]: Finished difference. Result has 57 places, 46 transitions, 104 flow [2021-03-26 10:07:27,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2021-03-26 10:07:27,684 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -4 predicate places. [2021-03-26 10:07:27,684 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:27,684 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 10:07:27,685 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 46 transitions, 104 flow [2021-03-26 10:07:27,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 46 transitions, 104 flow [2021-03-26 10:07:27,691 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-26 10:07:27,691 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:27,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:07:27,694 INFO L142 LiptonReduction]: Number of co-enabled transitions 652 [2021-03-26 10:07:28,541 INFO L154 LiptonReduction]: Checked pairs total: 2761 [2021-03-26 10:07:28,542 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:07:28,542 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 858 [2021-03-26 10:07:28,543 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 80 flow [2021-03-26 10:07:28,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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 10:07:28,544 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:28,544 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, 1] [2021-03-26 10:07:28,544 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:07:28,544 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:28,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:28,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1061219016, now seen corresponding path program 1 times [2021-03-26 10:07:28,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:28,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755971863] [2021-03-26 10:07:28,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:28,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:28,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:28,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:28,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:28,615 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 10:07:28,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:07:28,625 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:07:28,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:07:28,629 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 10:07:28,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755971863] [2021-03-26 10:07:28,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:28,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:07:28,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127329285] [2021-03-26 10:07:28,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:07:28,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:28,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:07:28,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:07:28,632 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 208 [2021-03-26 10:07:28,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 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 10:07:28,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:28,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 208 [2021-03-26 10:07:28,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:28,734 INFO L129 PetriNetUnfolder]: 241/518 cut-off events. [2021-03-26 10:07:28,734 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:07:28,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 518 events. 241/518 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2751 event pairs, 21 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 903. Up to 157 conditions per place. [2021-03-26 10:07:28,736 INFO L132 encePairwiseOnDemand]: 199/208 looper letters, 10 selfloop transitions, 7 changer transitions 18/59 dead transitions. [2021-03-26 10:07:28,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 200 flow [2021-03-26 10:07:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:07:28,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:07:28,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1185 transitions. [2021-03-26 10:07:28,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8138736263736264 [2021-03-26 10:07:28,739 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1185 transitions. [2021-03-26 10:07:28,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1185 transitions. [2021-03-26 10:07:28,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:28,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1185 transitions. [2021-03-26 10:07:28,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 169.28571428571428) internal successors, (1185), 7 states have internal predecessors, (1185), 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 10:07:28,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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 10:07:28,744 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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 10:07:28,744 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 80 flow. Second operand 7 states and 1185 transitions. [2021-03-26 10:07:28,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 200 flow [2021-03-26 10:07:28,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:07:28,746 INFO L241 Difference]: Finished difference. Result has 54 places, 38 transitions, 136 flow [2021-03-26 10:07:28,746 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2021-03-26 10:07:28,746 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -7 predicate places. [2021-03-26 10:07:28,746 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:28,746 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 38 transitions, 136 flow [2021-03-26 10:07:28,747 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 38 transitions, 136 flow [2021-03-26 10:07:28,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 136 flow [2021-03-26 10:07:28,800 INFO L129 PetriNetUnfolder]: 106/309 cut-off events. [2021-03-26 10:07:28,800 INFO L130 PetriNetUnfolder]: For 101/153 co-relation queries the response was YES. [2021-03-26 10:07:28,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 309 events. 106/309 cut-off events. For 101/153 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1801 event pairs, 61 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 667. Up to 153 conditions per place. [2021-03-26 10:07:28,803 INFO L142 LiptonReduction]: Number of co-enabled transitions 514 [2021-03-26 10:07:29,347 INFO L154 LiptonReduction]: Checked pairs total: 1125 [2021-03-26 10:07:29,348 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:07:29,348 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 602 [2021-03-26 10:07:29,348 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 130 flow [2021-03-26 10:07:29,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 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 10:07:29,349 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:29,349 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:29,349 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:07:29,349 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:29,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:29,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2031713254, now seen corresponding path program 1 times [2021-03-26 10:07:29,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:29,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174342459] [2021-03-26 10:07:29,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:29,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:29,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:29,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:29,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:29,385 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 10:07:29,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174342459] [2021-03-26 10:07:29,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:29,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:07:29,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068527791] [2021-03-26 10:07:29,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:07:29,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:29,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:07:29,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:07:29,386 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 211 [2021-03-26 10:07:29,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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 10:07:29,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:29,387 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 211 [2021-03-26 10:07:29,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:29,413 INFO L129 PetriNetUnfolder]: 93/269 cut-off events. [2021-03-26 10:07:29,413 INFO L130 PetriNetUnfolder]: For 192/294 co-relation queries the response was YES. [2021-03-26 10:07:29,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 269 events. 93/269 cut-off events. For 192/294 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1486 event pairs, 52 based on Foata normal form. 3/246 useless extension candidates. Maximal degree in co-relation 660. Up to 139 conditions per place. [2021-03-26 10:07:29,415 INFO L132 encePairwiseOnDemand]: 207/211 looper letters, 5 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2021-03-26 10:07:29,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 166 flow [2021-03-26 10:07:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:07:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:07:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-03-26 10:07:29,416 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8878357030015798 [2021-03-26 10:07:29,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-03-26 10:07:29,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-03-26 10:07:29,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:29,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-03-26 10:07:29,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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 10:07:29,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 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 10:07:29,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 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 10:07:29,419 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 130 flow. Second operand 3 states and 562 transitions. [2021-03-26 10:07:29,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 166 flow [2021-03-26 10:07:29,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 150 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-03-26 10:07:29,421 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 152 flow [2021-03-26 10:07:29,421 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 10:07:29,421 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -14 predicate places. [2021-03-26 10:07:29,421 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:29,421 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 152 flow [2021-03-26 10:07:29,421 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 152 flow [2021-03-26 10:07:29,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 152 flow [2021-03-26 10:07:29,441 INFO L129 PetriNetUnfolder]: 93/273 cut-off events. [2021-03-26 10:07:29,441 INFO L130 PetriNetUnfolder]: For 131/159 co-relation queries the response was YES. [2021-03-26 10:07:29,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 273 events. 93/273 cut-off events. For 131/159 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1516 event pairs, 37 based on Foata normal form. 0/252 useless extension candidates. Maximal degree in co-relation 586. Up to 139 conditions per place. [2021-03-26 10:07:29,443 INFO L142 LiptonReduction]: Number of co-enabled transitions 572 [2021-03-26 10:07:29,776 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 10:07:29,931 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 10:07:30,252 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 10:07:30,394 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 10:07:30,402 INFO L154 LiptonReduction]: Checked pairs total: 978 [2021-03-26 10:07:30,402 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:07:30,402 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 981 [2021-03-26 10:07:30,403 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 150 flow [2021-03-26 10:07:30,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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 10:07:30,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:30,404 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:30,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:07:30,404 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:30,404 INFO L82 PathProgramCache]: Analyzing trace with hash -600934187, now seen corresponding path program 1 times [2021-03-26 10:07:30,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:30,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648818491] [2021-03-26 10:07:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:30,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:30,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:30,446 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:07:30,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:07:30,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:30,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:30,453 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 10:07:30,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648818491] [2021-03-26 10:07:30,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:30,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:30,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596119552] [2021-03-26 10:07:30,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:30,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:30,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:30,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:30,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 212 [2021-03-26 10:07:30,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 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 10:07:30,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:30,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 212 [2021-03-26 10:07:30,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:30,571 INFO L129 PetriNetUnfolder]: 754/1413 cut-off events. [2021-03-26 10:07:30,571 INFO L130 PetriNetUnfolder]: For 301/399 co-relation queries the response was YES. [2021-03-26 10:07:30,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3044 conditions, 1413 events. 754/1413 cut-off events. For 301/399 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 10155 event pairs, 314 based on Foata normal form. 89/1208 useless extension candidates. Maximal degree in co-relation 3030. Up to 924 conditions per place. [2021-03-26 10:07:30,581 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 12 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2021-03-26 10:07:30,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 222 flow [2021-03-26 10:07:30,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:07:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:07:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 909 transitions. [2021-03-26 10:07:30,583 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8575471698113207 [2021-03-26 10:07:30,583 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 909 transitions. [2021-03-26 10:07:30,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 909 transitions. [2021-03-26 10:07:30,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:30,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 909 transitions. [2021-03-26 10:07:30,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 181.8) internal successors, (909), 5 states have internal predecessors, (909), 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 10:07:30,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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 10:07:30,586 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 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 10:07:30,586 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 150 flow. Second operand 5 states and 909 transitions. [2021-03-26 10:07:30,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 222 flow [2021-03-26 10:07:30,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:30,590 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 221 flow [2021-03-26 10:07:30,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2021-03-26 10:07:30,590 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -9 predicate places. [2021-03-26 10:07:30,590 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:30,590 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 221 flow [2021-03-26 10:07:30,591 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 221 flow [2021-03-26 10:07:30,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 221 flow [2021-03-26 10:07:30,693 INFO L129 PetriNetUnfolder]: 583/1157 cut-off events. [2021-03-26 10:07:30,693 INFO L130 PetriNetUnfolder]: For 843/1256 co-relation queries the response was YES. [2021-03-26 10:07:30,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 1157 events. 583/1157 cut-off events. For 843/1256 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 8511 event pairs, 273 based on Foata normal form. 5/1013 useless extension candidates. Maximal degree in co-relation 3245. Up to 703 conditions per place. [2021-03-26 10:07:30,703 INFO L142 LiptonReduction]: Number of co-enabled transitions 844 [2021-03-26 10:07:30,970 INFO L154 LiptonReduction]: Checked pairs total: 1146 [2021-03-26 10:07:30,970 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:07:30,970 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 380 [2021-03-26 10:07:30,970 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 215 flow [2021-03-26 10:07:30,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 177.75) internal successors, (711), 4 states have internal predecessors, (711), 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 10:07:30,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:30,971 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] [2021-03-26 10:07:30,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:07:30,971 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:30,972 INFO L82 PathProgramCache]: Analyzing trace with hash -380942309, now seen corresponding path program 1 times [2021-03-26 10:07:30,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:30,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167639903] [2021-03-26 10:07:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:31,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:31,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:31,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:31,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:07:31,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:31,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:07:31,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:31,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 10:07:31,058 INFO L142 QuantifierPusher]: treesize reduction 14, result has 67.4 percent of original size [2021-03-26 10:07:31,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 10:07:31,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:31,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:07:31,077 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 10:07:31,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167639903] [2021-03-26 10:07:31,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:31,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:07:31,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829885371] [2021-03-26 10:07:31,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:07:31,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:31,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:07:31,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:07:31,079 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 212 [2021-03-26 10:07:31,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 149.42857142857142) internal successors, (1046), 7 states have internal predecessors, (1046), 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 10:07:31,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:31,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 212 [2021-03-26 10:07:31,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:31,940 INFO L129 PetriNetUnfolder]: 4926/7877 cut-off events. [2021-03-26 10:07:31,940 INFO L130 PetriNetUnfolder]: For 9084/9769 co-relation queries the response was YES. [2021-03-26 10:07:31,956 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23996 conditions, 7877 events. 4926/7877 cut-off events. For 9084/9769 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 54500 event pairs, 890 based on Foata normal form. 181/7593 useless extension candidates. Maximal degree in co-relation 23978. Up to 2544 conditions per place. [2021-03-26 10:07:31,984 INFO L132 encePairwiseOnDemand]: 198/212 looper letters, 47 selfloop transitions, 42 changer transitions 0/107 dead transitions. [2021-03-26 10:07:31,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 107 transitions, 674 flow [2021-03-26 10:07:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:07:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:07:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1252 transitions. [2021-03-26 10:07:31,987 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7382075471698113 [2021-03-26 10:07:31,987 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1252 transitions. [2021-03-26 10:07:31,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1252 transitions. [2021-03-26 10:07:31,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:31,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1252 transitions. [2021-03-26 10:07:31,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.5) internal successors, (1252), 8 states have internal predecessors, (1252), 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 10:07:31,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 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 10:07:31,992 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 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 10:07:31,992 INFO L185 Difference]: Start difference. First operand has 52 places, 45 transitions, 215 flow. Second operand 8 states and 1252 transitions. [2021-03-26 10:07:31,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 107 transitions, 674 flow [2021-03-26 10:07:32,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 107 transitions, 659 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-26 10:07:32,046 INFO L241 Difference]: Finished difference. Result has 60 places, 79 transitions, 590 flow [2021-03-26 10:07:32,046 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=590, PETRI_PLACES=60, PETRI_TRANSITIONS=79} [2021-03-26 10:07:32,046 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, -1 predicate places. [2021-03-26 10:07:32,047 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:32,047 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 79 transitions, 590 flow [2021-03-26 10:07:32,047 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 79 transitions, 590 flow [2021-03-26 10:07:32,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 79 transitions, 590 flow [2021-03-26 10:07:32,509 INFO L129 PetriNetUnfolder]: 3302/5802 cut-off events. [2021-03-26 10:07:32,509 INFO L130 PetriNetUnfolder]: For 11648/13315 co-relation queries the response was YES. [2021-03-26 10:07:32,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20348 conditions, 5802 events. 3302/5802 cut-off events. For 11648/13315 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 45539 event pairs, 1041 based on Foata normal form. 195/5468 useless extension candidates. Maximal degree in co-relation 20327. Up to 2359 conditions per place. [2021-03-26 10:07:32,577 INFO L142 LiptonReduction]: Number of co-enabled transitions 1310 [2021-03-26 10:07:36,203 INFO L154 LiptonReduction]: Checked pairs total: 398 [2021-03-26 10:07:36,203 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:36,203 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4156 [2021-03-26 10:07:36,206 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 79 transitions, 590 flow [2021-03-26 10:07:36,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 149.42857142857142) internal successors, (1046), 7 states have internal predecessors, (1046), 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 10:07:36,206 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:36,206 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:36,206 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:07:36,207 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:36,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:36,207 INFO L82 PathProgramCache]: Analyzing trace with hash -371212202, now seen corresponding path program 1 times [2021-03-26 10:07:36,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:36,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304621503] [2021-03-26 10:07:36,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:36,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:36,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:36,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:36,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:36,240 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 10:07:36,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304621503] [2021-03-26 10:07:36,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:36,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:07:36,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403464685] [2021-03-26 10:07:36,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:07:36,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:36,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:07:36,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:07:36,242 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 212 [2021-03-26 10:07:36,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 79 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 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 10:07:36,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:36,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 212 [2021-03-26 10:07:36,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:36,773 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1158] L795-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_7| 0) (= v_~__unbuffered_cnt~0_149 (+ v_~__unbuffered_cnt~0_150 1)) (= |v_P1Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_150} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_149, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][34], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, Black: 161#(= ~__unbuffered_cnt~0 0), P0Thread1of1ForFork1InUse, Black: 164#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 53#P2EXITtrue, 86#L889true, Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 139#true, Black: 141#(= ~__unbuffered_p3_EAX~0 0), Black: 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), 25#L847true, Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 59#P0EXITtrue, 188#(= ~y~0 1), 126#P1EXITtrue, Black: 156#(= ~y~0 0)]) [2021-03-26 10:07:36,773 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-26 10:07:36,773 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:07:36,773 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:07:36,773 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-26 10:07:36,833 INFO L129 PetriNetUnfolder]: 3997/7005 cut-off events. [2021-03-26 10:07:36,833 INFO L130 PetriNetUnfolder]: For 18241/21249 co-relation queries the response was YES. [2021-03-26 10:07:36,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24703 conditions, 7005 events. 3997/7005 cut-off events. For 18241/21249 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 57006 event pairs, 1583 based on Foata normal form. 532/6753 useless extension candidates. Maximal degree in co-relation 24680. Up to 3148 conditions per place. [2021-03-26 10:07:36,885 INFO L132 encePairwiseOnDemand]: 209/212 looper letters, 6 selfloop transitions, 16 changer transitions 0/79 dead transitions. [2021-03-26 10:07:36,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 634 flow [2021-03-26 10:07:36,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:07:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:07:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2021-03-26 10:07:36,886 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8820754716981132 [2021-03-26 10:07:36,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 561 transitions. [2021-03-26 10:07:36,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 561 transitions. [2021-03-26 10:07:36,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:36,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 561 transitions. [2021-03-26 10:07:36,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 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 10:07:36,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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 10:07:36,888 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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 10:07:36,888 INFO L185 Difference]: Start difference. First operand has 60 places, 79 transitions, 590 flow. Second operand 3 states and 561 transitions. [2021-03-26 10:07:36,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 634 flow [2021-03-26 10:07:36,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 629 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:36,898 INFO L241 Difference]: Finished difference. Result has 62 places, 79 transitions, 635 flow [2021-03-26 10:07:36,898 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=62, PETRI_TRANSITIONS=79} [2021-03-26 10:07:36,899 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 1 predicate places. [2021-03-26 10:07:36,899 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:36,899 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 79 transitions, 635 flow [2021-03-26 10:07:36,899 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 79 transitions, 635 flow [2021-03-26 10:07:36,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 79 transitions, 635 flow [2021-03-26 10:07:37,440 INFO L129 PetriNetUnfolder]: 4213/7353 cut-off events. [2021-03-26 10:07:37,440 INFO L130 PetriNetUnfolder]: For 17732/19939 co-relation queries the response was YES. [2021-03-26 10:07:37,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25982 conditions, 7353 events. 4213/7353 cut-off events. For 17732/19939 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 60165 event pairs, 1327 based on Foata normal form. 253/6864 useless extension candidates. Maximal degree in co-relation 25960. Up to 3219 conditions per place. [2021-03-26 10:07:37,506 INFO L142 LiptonReduction]: Number of co-enabled transitions 1310 [2021-03-26 10:07:40,889 INFO L154 LiptonReduction]: Checked pairs total: 347 [2021-03-26 10:07:40,889 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:40,889 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3990 [2021-03-26 10:07:40,890 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 79 transitions, 635 flow [2021-03-26 10:07:40,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 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 10:07:40,890 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:40,890 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 10:07:40,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:07:40,890 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 44744624, now seen corresponding path program 1 times [2021-03-26 10:07:40,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:40,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040623065] [2021-03-26 10:07:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:40,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:40,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:40,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:40,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:40,992 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:07:40,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:07:40,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:40,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:40,997 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 10:07:40,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040623065] [2021-03-26 10:07:40,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:40,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:07:40,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514877496] [2021-03-26 10:07:40,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:07:40,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:40,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:07:40,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:07:40,999 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 212 [2021-03-26 10:07:40,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 79 transitions, 635 flow. Second operand has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 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 10:07:40,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:40,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 212 [2021-03-26 10:07:40,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:41,440 INFO L129 PetriNetUnfolder]: 3082/5790 cut-off events. [2021-03-26 10:07:41,440 INFO L130 PetriNetUnfolder]: For 15925/21876 co-relation queries the response was YES. [2021-03-26 10:07:41,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21897 conditions, 5790 events. 3082/5790 cut-off events. For 15925/21876 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 48771 event pairs, 491 based on Foata normal form. 1493/6628 useless extension candidates. Maximal degree in co-relation 21873. Up to 3245 conditions per place. [2021-03-26 10:07:41,476 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 15 selfloop transitions, 14 changer transitions 0/94 dead transitions. [2021-03-26 10:07:41,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 773 flow [2021-03-26 10:07:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:07:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:07:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1091 transitions. [2021-03-26 10:07:41,478 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8577044025157232 [2021-03-26 10:07:41,478 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1091 transitions. [2021-03-26 10:07:41,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1091 transitions. [2021-03-26 10:07:41,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:41,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1091 transitions. [2021-03-26 10:07:41,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 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 10:07:41,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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 10:07:41,481 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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 10:07:41,481 INFO L185 Difference]: Start difference. First operand has 62 places, 79 transitions, 635 flow. Second operand 6 states and 1091 transitions. [2021-03-26 10:07:41,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 773 flow [2021-03-26 10:07:41,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 751 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:41,490 INFO L241 Difference]: Finished difference. Result has 69 places, 88 transitions, 741 flow [2021-03-26 10:07:41,490 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=69, PETRI_TRANSITIONS=88} [2021-03-26 10:07:41,490 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 8 predicate places. [2021-03-26 10:07:41,491 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:41,491 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 88 transitions, 741 flow [2021-03-26 10:07:41,491 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 88 transitions, 741 flow [2021-03-26 10:07:41,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 88 transitions, 741 flow [2021-03-26 10:07:41,829 INFO L129 PetriNetUnfolder]: 2313/4646 cut-off events. [2021-03-26 10:07:41,829 INFO L130 PetriNetUnfolder]: For 16988/19354 co-relation queries the response was YES. [2021-03-26 10:07:41,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20652 conditions, 4646 events. 2313/4646 cut-off events. For 16988/19354 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 40168 event pairs, 390 based on Foata normal form. 340/4686 useless extension candidates. Maximal degree in co-relation 20626. Up to 2497 conditions per place. [2021-03-26 10:07:41,880 INFO L142 LiptonReduction]: Number of co-enabled transitions 1812 [2021-03-26 10:07:42,717 INFO L154 LiptonReduction]: Checked pairs total: 454 [2021-03-26 10:07:42,718 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:42,718 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1227 [2021-03-26 10:07:42,718 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 88 transitions, 741 flow [2021-03-26 10:07:42,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 177.8) internal successors, (889), 5 states have internal predecessors, (889), 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 10:07:42,719 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:42,719 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 10:07:42,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:07:42,719 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:42,719 INFO L82 PathProgramCache]: Analyzing trace with hash -334565284, now seen corresponding path program 1 times [2021-03-26 10:07:42,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:42,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243889286] [2021-03-26 10:07:42,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:42,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:42,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:42,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:42,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:42,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:42,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:42,785 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:07:42,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:07:42,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:42,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:42,791 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 10:07:42,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243889286] [2021-03-26 10:07:42,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:42,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:07:42,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336380349] [2021-03-26 10:07:42,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:07:42,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:42,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:07:42,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:07:42,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 212 [2021-03-26 10:07:42,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 88 transitions, 741 flow. Second operand has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 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 10:07:42,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:42,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 212 [2021-03-26 10:07:42,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:43,222 INFO L129 PetriNetUnfolder]: 2457/4778 cut-off events. [2021-03-26 10:07:43,223 INFO L130 PetriNetUnfolder]: For 27741/40173 co-relation queries the response was YES. [2021-03-26 10:07:43,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22991 conditions, 4778 events. 2457/4778 cut-off events. For 27741/40173 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 40456 event pairs, 160 based on Foata normal form. 1913/6138 useless extension candidates. Maximal degree in co-relation 22963. Up to 3046 conditions per place. [2021-03-26 10:07:43,261 INFO L132 encePairwiseOnDemand]: 205/212 looper letters, 12 selfloop transitions, 23 changer transitions 4/104 dead transitions. [2021-03-26 10:07:43,261 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 104 transitions, 951 flow [2021-03-26 10:07:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:07:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:07:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1455 transitions. [2021-03-26 10:07:43,263 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8579009433962265 [2021-03-26 10:07:43,263 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1455 transitions. [2021-03-26 10:07:43,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1455 transitions. [2021-03-26 10:07:43,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:43,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1455 transitions. [2021-03-26 10:07:43,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 181.875) internal successors, (1455), 8 states have internal predecessors, (1455), 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 10:07:43,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 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 10:07:43,268 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 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 10:07:43,268 INFO L185 Difference]: Start difference. First operand has 69 places, 88 transitions, 741 flow. Second operand 8 states and 1455 transitions. [2021-03-26 10:07:43,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 104 transitions, 951 flow [2021-03-26 10:07:43,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 104 transitions, 907 flow, removed 17 selfloop flow, removed 2 redundant places. [2021-03-26 10:07:43,554 INFO L241 Difference]: Finished difference. Result has 77 places, 97 transitions, 873 flow [2021-03-26 10:07:43,555 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=873, PETRI_PLACES=77, PETRI_TRANSITIONS=97} [2021-03-26 10:07:43,555 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2021-03-26 10:07:43,555 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:43,555 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 97 transitions, 873 flow [2021-03-26 10:07:43,555 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 97 transitions, 873 flow [2021-03-26 10:07:43,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 97 transitions, 873 flow [2021-03-26 10:07:43,792 INFO L129 PetriNetUnfolder]: 1643/3699 cut-off events. [2021-03-26 10:07:43,793 INFO L130 PetriNetUnfolder]: For 15518/16389 co-relation queries the response was YES. [2021-03-26 10:07:43,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16644 conditions, 3699 events. 1643/3699 cut-off events. For 15518/16389 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 34004 event pairs, 109 based on Foata normal form. 186/3704 useless extension candidates. Maximal degree in co-relation 16615. Up to 1666 conditions per place. [2021-03-26 10:07:43,832 INFO L142 LiptonReduction]: Number of co-enabled transitions 1986 [2021-03-26 10:07:44,432 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:07:44,552 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:07:45,247 INFO L154 LiptonReduction]: Checked pairs total: 467 [2021-03-26 10:07:45,247 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:07:45,248 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1693 [2021-03-26 10:07:45,248 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 97 transitions, 885 flow [2021-03-26 10:07:45,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 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 10:07:45,248 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:45,248 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, 1, 1] [2021-03-26 10:07:45,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:07:45,249 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:45,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1042577144, now seen corresponding path program 1 times [2021-03-26 10:07:45,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:45,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374113572] [2021-03-26 10:07:45,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:45,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:45,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:45,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:45,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:45,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:45,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:45,294 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 10:07:45,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374113572] [2021-03-26 10:07:45,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:45,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:45,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203830298] [2021-03-26 10:07:45,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:45,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:45,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:45,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:45,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 213 [2021-03-26 10:07:45,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 97 transitions, 885 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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 10:07:45,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:45,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 213 [2021-03-26 10:07:45,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:45,504 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L768-->L775: Formula: (let ((.cse8 (= (mod v_~b$w_buff0_used~0_455 256) 0)) (.cse9 (= (mod v_~b$r_buff1_thd1~0_58 256) 0)) (.cse13 (= (mod v_~b$w_buff1_used~0_360 256) 0)) (.cse12 (= (mod v_~b$r_buff0_thd1~0_71 256) 0)) (.cse14 (= (mod v_~b$w_buff0_used~0_456 256) 0))) (let ((.cse2 (or .cse12 .cse14)) (.cse0 (not .cse14)) (.cse10 (not .cse13)) (.cse7 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (not .cse12)) (.cse11 (or .cse9 .cse13)) (.cse4 (or .cse12 .cse8))) (and (or (and .cse0 (= v_~b$w_buff0_used~0_455 0) .cse1) (and (= v_~b$w_buff0_used~0_456 v_~b$w_buff0_used~0_455) .cse2)) (or (and .cse3 (= v_~b$r_buff0_thd1~0_70 0) .cse1) (and .cse4 (= v_~b$r_buff0_thd1~0_71 v_~b$r_buff0_thd1~0_70))) (let ((.cse5 (= (mod v_~b$r_buff0_thd1~0_70 256) 0)) (.cse6 (= (mod v_~b$w_buff1_used~0_359 256) 0))) (or (and (= v_~b$r_buff1_thd1~0_57 0) (or (and .cse3 (not .cse5)) (and (not .cse6) .cse7))) (and (= v_~b$r_buff1_thd1~0_58 v_~b$r_buff1_thd1~0_57) (or .cse8 .cse5) (or .cse6 .cse9)))) (or (and (or (and .cse10 (= v_~b$w_buff1~0_102 |v_P0_#t~ite5_35|) .cse7) (and (= |v_P0_#t~ite5_35| v_~b~0_147) .cse11)) .cse2 (= |v_P0_#t~ite5_35| v_~b~0_146)) (and (= v_~b~0_146 v_~b$w_buff0~0_83) .cse0 .cse1 (= |v_P0_#t~ite5_35| |v_P0Thread1of1ForFork1_#t~ite5_1|))) (or (and (or (and .cse10 .cse7) (and .cse3 .cse1)) (= v_~b$w_buff1_used~0_359 0)) (and (= v_~b$w_buff1_used~0_359 v_~b$w_buff1_used~0_360) .cse11 .cse4))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_456, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_71, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_1|, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_58, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_360, ~b~0=v_~b~0_147, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_70, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_57, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_455, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_2|, P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_1|, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_1|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_359, ~b~0=v_~b~0_146, P0Thread1of1ForFork1_#t~ite6=|v_P0Thread1of1ForFork1_#t~ite6_1|, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} AuxVars[|v_P0_#t~ite5_35|] AssignedVars[P0Thread1of1ForFork1_#t~ite10, ~b$w_buff0_used~0, ~b$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite5, ~b$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9, ~b$w_buff1_used~0, ~b~0, P0Thread1of1ForFork1_#t~ite6, P0Thread1of1ForFork1_#t~ite7][6], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 69#L785true, P0Thread1of1ForFork1InUse, Black: 194#(<= ~__unbuffered_cnt~0 1), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 139#true, 204#(= ~__unbuffered_cnt~0 0), 78#L854true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 206#(<= ~__unbuffered_cnt~0 2), Black: 141#(= ~__unbuffered_p3_EAX~0 0), Black: 207#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 88#L878-1true, Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#(= ~z~0 1), 28#L815true, Black: 156#(= ~y~0 0), 161#(= ~__unbuffered_cnt~0 0), Black: 164#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (= ~__unbuffered_cnt~0 0)), 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 114#L775true, Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 188#(= ~y~0 1)]) [2021-03-26 10:07:45,505 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 10:07:45,505 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 10:07:45,505 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 10:07:45,505 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 10:07:45,764 INFO L129 PetriNetUnfolder]: 2621/5668 cut-off events. [2021-03-26 10:07:45,764 INFO L130 PetriNetUnfolder]: For 28453/30489 co-relation queries the response was YES. [2021-03-26 10:07:45,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26166 conditions, 5668 events. 2621/5668 cut-off events. For 28453/30489 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 54030 event pairs, 264 based on Foata normal form. 368/5655 useless extension candidates. Maximal degree in co-relation 26135. Up to 2665 conditions per place. [2021-03-26 10:07:45,797 INFO L132 encePairwiseOnDemand]: 209/213 looper letters, 6 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2021-03-26 10:07:45,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 100 transitions, 933 flow [2021-03-26 10:07:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:07:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:07:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 736 transitions. [2021-03-26 10:07:45,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.863849765258216 [2021-03-26 10:07:45,800 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 736 transitions. [2021-03-26 10:07:45,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 736 transitions. [2021-03-26 10:07:45,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:45,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 736 transitions. [2021-03-26 10:07:45,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 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 10:07:45,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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 10:07:45,803 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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 10:07:45,803 INFO L185 Difference]: Start difference. First operand has 77 places, 97 transitions, 885 flow. Second operand 4 states and 736 transitions. [2021-03-26 10:07:45,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 100 transitions, 933 flow [2021-03-26 10:07:46,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 832 flow, removed 41 selfloop flow, removed 4 redundant places. [2021-03-26 10:07:46,399 INFO L241 Difference]: Finished difference. Result has 78 places, 100 transitions, 841 flow [2021-03-26 10:07:46,399 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=841, PETRI_PLACES=78, PETRI_TRANSITIONS=100} [2021-03-26 10:07:46,400 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 17 predicate places. [2021-03-26 10:07:46,400 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:46,400 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 100 transitions, 841 flow [2021-03-26 10:07:46,400 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 100 transitions, 841 flow [2021-03-26 10:07:46,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 100 transitions, 841 flow [2021-03-26 10:07:46,791 INFO L129 PetriNetUnfolder]: 2685/5964 cut-off events. [2021-03-26 10:07:46,791 INFO L130 PetriNetUnfolder]: For 16432/17595 co-relation queries the response was YES. [2021-03-26 10:07:46,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21394 conditions, 5964 events. 2685/5964 cut-off events. For 16432/17595 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 58730 event pairs, 207 based on Foata normal form. 382/6017 useless extension candidates. Maximal degree in co-relation 21364. Up to 1396 conditions per place. [2021-03-26 10:07:46,889 INFO L142 LiptonReduction]: Number of co-enabled transitions 2036 [2021-03-26 10:07:50,479 INFO L154 LiptonReduction]: Checked pairs total: 425 [2021-03-26 10:07:50,479 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:07:50,479 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4079 [2021-03-26 10:07:50,480 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 100 transitions, 844 flow [2021-03-26 10:07:50,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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 10:07:50,480 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:50,480 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, 1, 1] [2021-03-26 10:07:50,480 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:07:50,480 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:50,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:50,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1003763402, now seen corresponding path program 2 times [2021-03-26 10:07:50,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:50,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311504861] [2021-03-26 10:07:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:50,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:50,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:50,529 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-26 10:07:50,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:07:50,539 INFO L142 QuantifierPusher]: treesize reduction 21, result has 64.4 percent of original size [2021-03-26 10:07:50,539 INFO L147 QuantifierPusher]: treesize reduction 8, result has 78.9 percent of original size 30 [2021-03-26 10:07:50,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:50,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:50,553 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 10:07:50,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311504861] [2021-03-26 10:07:50,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:50,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:07:50,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581527112] [2021-03-26 10:07:50,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:07:50,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:50,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:07:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:07:50,555 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 214 [2021-03-26 10:07:50,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 100 transitions, 844 flow. Second operand has 5 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 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 10:07:50,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:50,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 214 [2021-03-26 10:07:50,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:51,218 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L768-->L775: Formula: (let ((.cse8 (= (mod v_~b$w_buff0_used~0_455 256) 0)) (.cse9 (= (mod v_~b$r_buff1_thd1~0_58 256) 0)) (.cse13 (= (mod v_~b$w_buff1_used~0_360 256) 0)) (.cse12 (= (mod v_~b$r_buff0_thd1~0_71 256) 0)) (.cse14 (= (mod v_~b$w_buff0_used~0_456 256) 0))) (let ((.cse2 (or .cse12 .cse14)) (.cse0 (not .cse14)) (.cse10 (not .cse13)) (.cse7 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (not .cse12)) (.cse11 (or .cse9 .cse13)) (.cse4 (or .cse12 .cse8))) (and (or (and .cse0 (= v_~b$w_buff0_used~0_455 0) .cse1) (and (= v_~b$w_buff0_used~0_456 v_~b$w_buff0_used~0_455) .cse2)) (or (and .cse3 (= v_~b$r_buff0_thd1~0_70 0) .cse1) (and .cse4 (= v_~b$r_buff0_thd1~0_71 v_~b$r_buff0_thd1~0_70))) (let ((.cse5 (= (mod v_~b$r_buff0_thd1~0_70 256) 0)) (.cse6 (= (mod v_~b$w_buff1_used~0_359 256) 0))) (or (and (= v_~b$r_buff1_thd1~0_57 0) (or (and .cse3 (not .cse5)) (and (not .cse6) .cse7))) (and (= v_~b$r_buff1_thd1~0_58 v_~b$r_buff1_thd1~0_57) (or .cse8 .cse5) (or .cse6 .cse9)))) (or (and (or (and .cse10 (= v_~b$w_buff1~0_102 |v_P0_#t~ite5_35|) .cse7) (and (= |v_P0_#t~ite5_35| v_~b~0_147) .cse11)) .cse2 (= |v_P0_#t~ite5_35| v_~b~0_146)) (and (= v_~b~0_146 v_~b$w_buff0~0_83) .cse0 .cse1 (= |v_P0_#t~ite5_35| |v_P0Thread1of1ForFork1_#t~ite5_1|))) (or (and (or (and .cse10 .cse7) (and .cse3 .cse1)) (= v_~b$w_buff1_used~0_359 0)) (and (= v_~b$w_buff1_used~0_359 v_~b$w_buff1_used~0_360) .cse11 .cse4))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_456, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_71, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_1|, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_58, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_360, ~b~0=v_~b~0_147, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_70, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_57, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_455, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_2|, P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_1|, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_1|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_359, ~b~0=v_~b~0_146, P0Thread1of1ForFork1_#t~ite6=|v_P0Thread1of1ForFork1_#t~ite6_1|, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} AuxVars[|v_P0_#t~ite5_35|] AssignedVars[P0Thread1of1ForFork1_#t~ite10, ~b$w_buff0_used~0, ~b$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite5, ~b$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9, ~b$w_buff1_used~0, ~b~0, P0Thread1of1ForFork1_#t~ite6, P0Thread1of1ForFork1_#t~ite7][37], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(<= ~__unbuffered_cnt~0 1), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 139#true, 204#(= ~__unbuffered_cnt~0 0), 78#L854true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 206#(<= ~__unbuffered_cnt~0 2), Black: 207#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 141#(= ~__unbuffered_p3_EAX~0 0), 88#L878-1true, Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 218#(= ~z~0 1), 28#L815true, Black: 156#(= ~y~0 0), 95#L788true, Black: 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), 225#true, 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 114#L775true, Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 188#(= ~y~0 1)]) [2021-03-26 10:07:51,218 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 10:07:51,218 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:51,218 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:51,218 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:51,236 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1079] L788-->L795: Formula: (let ((.cse12 (= (mod v_~b$w_buff0_used~0_474 256) 0)) (.cse14 (= (mod v_~b$w_buff1_used~0_378 256) 0)) (.cse3 (= (mod v_~b$r_buff1_thd2~0_52 256) 0)) (.cse13 (= (mod v_~b$r_buff0_thd2~0_64 256) 0)) (.cse0 (= (mod v_~b$w_buff0_used~0_473 256) 0))) (let ((.cse7 (or .cse13 .cse0)) (.cse10 (or .cse14 .cse3)) (.cse5 (not .cse0)) (.cse11 (not .cse14)) (.cse4 (not .cse3)) (.cse9 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse8 (not .cse12))) (and (let ((.cse2 (= (mod v_~b$w_buff1_used~0_377 256) 0)) (.cse1 (= (mod v_~b$r_buff0_thd2~0_63 256) 0))) (or (and (= v_~b$r_buff1_thd2~0_52 v_~b$r_buff1_thd2~0_51) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) .cse4) (and .cse5 (not .cse1))) (= v_~b$r_buff1_thd2~0_51 0)))) (or (and .cse5 .cse6 (= v_~b$r_buff0_thd2~0_63 0)) (and .cse7 (= v_~b$r_buff0_thd2~0_64 v_~b$r_buff0_thd2~0_63))) (or (and .cse6 (= v_~b~0_162 v_~b$w_buff0~0_87) (= |v_P1_#t~ite11_43| |v_P1Thread1of1ForFork2_#t~ite11_1|) .cse8) (and (= |v_P1_#t~ite11_43| v_~b~0_162) .cse9 (or (and (= |v_P1_#t~ite11_43| v_~b~0_163) .cse10) (and .cse11 .cse4 (= v_~b$w_buff1~0_108 |v_P1_#t~ite11_43|))))) (or (and (= v_~b$w_buff1_used~0_378 v_~b$w_buff1_used~0_377) .cse7 .cse10) (and (or (and .cse5 .cse6) (and .cse11 .cse4)) (= v_~b$w_buff1_used~0_377 0))) (or (and .cse9 (= v_~b$w_buff0_used~0_474 v_~b$w_buff0_used~0_473)) (and .cse6 (= v_~b$w_buff0_used~0_473 0) .cse8))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_474, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_64, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_378, ~b~0=v_~b~0_163, ~b$w_buff1~0=v_~b$w_buff1~0_108, ~b$w_buff0~0=v_~b$w_buff0~0_87, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_1|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_52} OutVars{~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_63, P1Thread1of1ForFork2_#t~ite12=|v_P1Thread1of1ForFork2_#t~ite12_1|, P1Thread1of1ForFork2_#t~ite11=|v_P1Thread1of1ForFork2_#t~ite11_2|, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_1|, P1Thread1of1ForFork2_#t~ite13=|v_P1Thread1of1ForFork2_#t~ite13_1|, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_1|, P1Thread1of1ForFork2_#t~ite15=|v_P1Thread1of1ForFork2_#t~ite15_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_473, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_377, ~b~0=v_~b~0_162, ~b$w_buff1~0=v_~b$w_buff1~0_108, ~b$w_buff0~0=v_~b$w_buff0~0_87, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_51} AuxVars[|v_P1_#t~ite11_43|] AssignedVars[~b$w_buff0_used~0, ~b$r_buff0_thd2~0, ~b$w_buff1_used~0, ~b~0, P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11, P1Thread1of1ForFork2_#t~ite14, ~b$r_buff1_thd2~0, P1Thread1of1ForFork2_#t~ite13, P1Thread1of1ForFork2_#t~ite16, P1Thread1of1ForFork2_#t~ite15][22], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(<= ~__unbuffered_cnt~0 1), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 204#(= ~__unbuffered_cnt~0 0), 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 78#L854true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 206#(<= ~__unbuffered_cnt~0 2), Black: 139#true, Black: 141#(= ~__unbuffered_p3_EAX~0 0), Black: 207#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), 88#L878-1true, 218#(= ~z~0 1), 28#L815true, Black: 156#(= ~y~0 0), 30#L795true, Black: 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), 225#true, 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 51#L768true, Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 188#(= ~y~0 1)]) [2021-03-26 10:07:51,236 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 10:07:51,236 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:51,236 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:51,236 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:51,615 INFO L129 PetriNetUnfolder]: 5186/11457 cut-off events. [2021-03-26 10:07:51,615 INFO L130 PetriNetUnfolder]: For 36837/39442 co-relation queries the response was YES. [2021-03-26 10:07:51,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42770 conditions, 11457 events. 5186/11457 cut-off events. For 36837/39442 co-relation queries the response was YES. Maximal size of possible extension queue 1329. Compared 123873 event pairs, 369 based on Foata normal form. 735/11636 useless extension candidates. Maximal degree in co-relation 42738. Up to 2567 conditions per place. [2021-03-26 10:07:51,676 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 22 selfloop transitions, 32 changer transitions 9/136 dead transitions. [2021-03-26 10:07:51,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 136 transitions, 1250 flow [2021-03-26 10:07:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:07:51,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:07:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1028 transitions. [2021-03-26 10:07:51,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8006230529595015 [2021-03-26 10:07:51,678 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1028 transitions. [2021-03-26 10:07:51,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1028 transitions. [2021-03-26 10:07:51,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:51,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1028 transitions. [2021-03-26 10:07:51,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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 10:07:51,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 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 10:07:51,682 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 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 10:07:51,682 INFO L185 Difference]: Start difference. First operand has 78 places, 100 transitions, 844 flow. Second operand 6 states and 1028 transitions. [2021-03-26 10:07:51,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 136 transitions, 1250 flow [2021-03-26 10:07:53,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 136 transitions, 1248 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:53,082 INFO L241 Difference]: Finished difference. Result has 86 places, 126 transitions, 1160 flow [2021-03-26 10:07:53,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1160, PETRI_PLACES=86, PETRI_TRANSITIONS=126} [2021-03-26 10:07:53,082 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 25 predicate places. [2021-03-26 10:07:53,082 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:53,082 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 126 transitions, 1160 flow [2021-03-26 10:07:53,083 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 126 transitions, 1160 flow [2021-03-26 10:07:53,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 126 transitions, 1160 flow [2021-03-26 10:07:53,503 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1086] L808-->L815: Formula: (let ((.cse10 (= (mod v_~b$w_buff0_used~0_427 256) 0)) (.cse12 (= (mod v_~b$r_buff0_thd3~0_68 256) 0)) (.cse13 (= (mod v_~b$w_buff0_used~0_428 256) 0)) (.cse8 (= (mod v_~b$r_buff1_thd3~0_48 256) 0)) (.cse14 (= (mod v_~b$w_buff1_used~0_324 256) 0))) (let ((.cse4 (not .cse14)) (.cse5 (not .cse8)) (.cse1 (or .cse8 .cse14)) (.cse6 (or .cse12 .cse13)) (.cse7 (not .cse13)) (.cse2 (not .cse12)) (.cse3 (not .cse10)) (.cse0 (or .cse12 .cse10))) (and (or (and .cse0 (= v_~b$w_buff1_used~0_324 v_~b$w_buff1_used~0_323) .cse1) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~b$w_buff1_used~0_323 0))) (or (and (= v_~b$w_buff0_used~0_428 v_~b$w_buff0_used~0_427) .cse6) (and .cse7 .cse2 (= v_~b$w_buff0_used~0_427 0))) (let ((.cse9 (= (mod v_~b$w_buff1_used~0_323 256) 0)) (.cse11 (= (mod v_~b$r_buff0_thd3~0_67 256) 0))) (or (and (= v_~b$r_buff1_thd3~0_48 v_~b$r_buff1_thd3~0_47) (or .cse8 .cse9) (or .cse10 .cse11)) (and (= v_~b$r_buff1_thd3~0_47 0) (or (and (not .cse9) .cse5) (and (not .cse11) .cse3))))) (or (and (or (and .cse4 .cse5 (= |v_P2_#t~ite17_33| v_~b$w_buff1~0_88)) (and (= |v_P2_#t~ite17_33| v_~b~0_131) .cse1)) (= |v_P2_#t~ite17_33| v_~b~0_130) .cse6) (and .cse7 .cse2 (= |v_P2Thread1of1ForFork3_#t~ite17_1| |v_P2_#t~ite17_33|) (= v_~b~0_130 v_~b$w_buff0~0_77))) (or (and .cse2 .cse3 (= v_~b$r_buff0_thd3~0_67 0)) (and .cse0 (= v_~b$r_buff0_thd3~0_68 v_~b$r_buff0_thd3~0_67)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_428, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_324, ~b~0=v_~b~0_131, ~b$w_buff1~0=v_~b$w_buff1~0_88, ~b$w_buff0~0=v_~b$w_buff0~0_77, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_48, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_427, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_323, ~b~0=v_~b~0_130, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~b$w_buff1~0=v_~b$w_buff1~0_88, ~b$w_buff0~0=v_~b$w_buff0~0_77, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_47, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_33|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, P2Thread1of1ForFork3_#t~ite20, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~b$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][30], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(<= ~__unbuffered_cnt~0 1), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 139#true, 204#(= ~__unbuffered_cnt~0 0), Black: 211#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 206#(<= ~__unbuffered_cnt~0 2), Black: 207#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 141#(= ~__unbuffered_p3_EAX~0 0), 88#L878-1true, Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 25#L847true, 28#L815true, 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 156#(= ~y~0 0), 30#L795true, Black: 218#(= ~z~0 1), 225#true, Black: 227#(and (= ~b$w_buff0~0 1) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 228#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1)), Black: 229#(= ~__unbuffered_p3_EBX~0 1), Black: 231#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), 114#L775true, Black: 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 188#(= ~y~0 1)]) [2021-03-26 10:07:53,504 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-26 10:07:53,504 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 10:07:53,504 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 10:07:53,504 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-26 10:07:53,598 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1086] L808-->L815: Formula: (let ((.cse10 (= (mod v_~b$w_buff0_used~0_427 256) 0)) (.cse12 (= (mod v_~b$r_buff0_thd3~0_68 256) 0)) (.cse13 (= (mod v_~b$w_buff0_used~0_428 256) 0)) (.cse8 (= (mod v_~b$r_buff1_thd3~0_48 256) 0)) (.cse14 (= (mod v_~b$w_buff1_used~0_324 256) 0))) (let ((.cse4 (not .cse14)) (.cse5 (not .cse8)) (.cse1 (or .cse8 .cse14)) (.cse6 (or .cse12 .cse13)) (.cse7 (not .cse13)) (.cse2 (not .cse12)) (.cse3 (not .cse10)) (.cse0 (or .cse12 .cse10))) (and (or (and .cse0 (= v_~b$w_buff1_used~0_324 v_~b$w_buff1_used~0_323) .cse1) (and (or (and .cse2 .cse3) (and .cse4 .cse5)) (= v_~b$w_buff1_used~0_323 0))) (or (and (= v_~b$w_buff0_used~0_428 v_~b$w_buff0_used~0_427) .cse6) (and .cse7 .cse2 (= v_~b$w_buff0_used~0_427 0))) (let ((.cse9 (= (mod v_~b$w_buff1_used~0_323 256) 0)) (.cse11 (= (mod v_~b$r_buff0_thd3~0_67 256) 0))) (or (and (= v_~b$r_buff1_thd3~0_48 v_~b$r_buff1_thd3~0_47) (or .cse8 .cse9) (or .cse10 .cse11)) (and (= v_~b$r_buff1_thd3~0_47 0) (or (and (not .cse9) .cse5) (and (not .cse11) .cse3))))) (or (and (or (and .cse4 .cse5 (= |v_P2_#t~ite17_33| v_~b$w_buff1~0_88)) (and (= |v_P2_#t~ite17_33| v_~b~0_131) .cse1)) (= |v_P2_#t~ite17_33| v_~b~0_130) .cse6) (and .cse7 .cse2 (= |v_P2Thread1of1ForFork3_#t~ite17_1| |v_P2_#t~ite17_33|) (= v_~b~0_130 v_~b$w_buff0~0_77))) (or (and .cse2 .cse3 (= v_~b$r_buff0_thd3~0_67 0)) (and .cse0 (= v_~b$r_buff0_thd3~0_68 v_~b$r_buff0_thd3~0_67)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_428, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_68, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_324, ~b~0=v_~b~0_131, ~b$w_buff1~0=v_~b$w_buff1~0_88, ~b$w_buff0~0=v_~b$w_buff0~0_77, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_48, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_1|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_67, P2Thread1of1ForFork3_#t~ite22=|v_P2Thread1of1ForFork3_#t~ite22_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_427, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_323, ~b~0=v_~b~0_130, P2Thread1of1ForFork3_#t~ite20=|v_P2Thread1of1ForFork3_#t~ite20_1|, P2Thread1of1ForFork3_#t~ite21=|v_P2Thread1of1ForFork3_#t~ite21_1|, P2Thread1of1ForFork3_#t~ite19=|v_P2Thread1of1ForFork3_#t~ite19_1|, ~b$w_buff1~0=v_~b$w_buff1~0_88, ~b$w_buff0~0=v_~b$w_buff0~0_77, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_47, P2Thread1of1ForFork3_#t~ite17=|v_P2Thread1of1ForFork3_#t~ite17_2|, P2Thread1of1ForFork3_#t~ite18=|v_P2Thread1of1ForFork3_#t~ite18_1|} AuxVars[|v_P2_#t~ite17_33|] AssignedVars[P2Thread1of1ForFork3_#t~ite22, ~b$w_buff0_used~0, ~b$r_buff0_thd3~0, ~b$w_buff1_used~0, ~b~0, P2Thread1of1ForFork3_#t~ite20, P2Thread1of1ForFork3_#t~ite21, P2Thread1of1ForFork3_#t~ite19, ~b$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite17, P2Thread1of1ForFork3_#t~ite18][30], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(<= ~__unbuffered_cnt~0 1), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 139#true, 204#(= ~__unbuffered_cnt~0 0), 78#L854true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 206#(<= ~__unbuffered_cnt~0 2), Black: 207#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 141#(= ~__unbuffered_p3_EAX~0 0), 88#L878-1true, Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 28#L815true, 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), Black: 156#(= ~y~0 0), 30#L795true, Black: 218#(= ~z~0 1), 225#true, Black: 227#(and (= ~b$w_buff0~0 1) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 228#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1)), Black: 229#(= ~__unbuffered_p3_EBX~0 1), 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 231#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), 114#L775true, Black: 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 188#(= ~y~0 1)]) [2021-03-26 10:07:53,598 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 10:07:53,598 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:53,598 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:53,598 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:54,010 INFO L129 PetriNetUnfolder]: 5040/11371 cut-off events. [2021-03-26 10:07:54,011 INFO L130 PetriNetUnfolder]: For 40317/43057 co-relation queries the response was YES. [2021-03-26 10:07:54,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43520 conditions, 11371 events. 5040/11371 cut-off events. For 40317/43057 co-relation queries the response was YES. Maximal size of possible extension queue 1377. Compared 124499 event pairs, 392 based on Foata normal form. 716/11427 useless extension candidates. Maximal degree in co-relation 43486. Up to 2622 conditions per place. [2021-03-26 10:07:54,126 INFO L142 LiptonReduction]: Number of co-enabled transitions 2716 [2021-03-26 10:07:54,534 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:07:54,534 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:54,535 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1453 [2021-03-26 10:07:54,535 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 126 transitions, 1160 flow [2021-03-26 10:07:54,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 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 10:07:54,535 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:54,535 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, 1, 1] [2021-03-26 10:07:54,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:07:54,536 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:54,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:54,536 INFO L82 PathProgramCache]: Analyzing trace with hash 366818604, now seen corresponding path program 1 times [2021-03-26 10:07:54,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:54,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002839704] [2021-03-26 10:07:54,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:54,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:54,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:07:54,594 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.9 percent of original size [2021-03-26 10:07:54,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 10:07:54,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:54,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:07:54,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:54,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:07:54,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:54,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:54,634 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 10:07:54,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002839704] [2021-03-26 10:07:54,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:54,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:07:54,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100674323] [2021-03-26 10:07:54,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:07:54,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:54,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:07:54,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:07:54,636 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 214 [2021-03-26 10:07:54,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 126 transitions, 1160 flow. Second operand has 7 states, 7 states have (on average 158.14285714285714) internal successors, (1107), 7 states have internal predecessors, (1107), 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 10:07:54,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:54,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 214 [2021-03-26 10:07:54,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:56,000 INFO L129 PetriNetUnfolder]: 6452/14260 cut-off events. [2021-03-26 10:07:56,001 INFO L130 PetriNetUnfolder]: For 63411/68227 co-relation queries the response was YES. [2021-03-26 10:07:56,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57600 conditions, 14260 events. 6452/14260 cut-off events. For 63411/68227 co-relation queries the response was YES. Maximal size of possible extension queue 1827. Compared 159723 event pairs, 341 based on Foata normal form. 1064/14564 useless extension candidates. Maximal degree in co-relation 57564. Up to 3365 conditions per place. [2021-03-26 10:07:56,100 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 40 selfloop transitions, 30 changer transitions 5/148 dead transitions. [2021-03-26 10:07:56,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 148 transitions, 1540 flow [2021-03-26 10:07:56,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:07:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:07:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1129 transitions. [2021-03-26 10:07:56,102 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7536715620827771 [2021-03-26 10:07:56,102 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1129 transitions. [2021-03-26 10:07:56,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1129 transitions. [2021-03-26 10:07:56,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:56,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1129 transitions. [2021-03-26 10:07:56,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.28571428571428) internal successors, (1129), 7 states have internal predecessors, (1129), 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 10:07:56,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 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 10:07:56,106 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 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 10:07:56,107 INFO L185 Difference]: Start difference. First operand has 86 places, 126 transitions, 1160 flow. Second operand 7 states and 1129 transitions. [2021-03-26 10:07:56,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 148 transitions, 1540 flow [2021-03-26 10:07:58,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 148 transitions, 1536 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-26 10:07:58,434 INFO L241 Difference]: Finished difference. Result has 95 places, 133 transitions, 1339 flow [2021-03-26 10:07:58,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1339, PETRI_PLACES=95, PETRI_TRANSITIONS=133} [2021-03-26 10:07:58,434 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 34 predicate places. [2021-03-26 10:07:58,434 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:58,434 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 133 transitions, 1339 flow [2021-03-26 10:07:58,434 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 133 transitions, 1339 flow [2021-03-26 10:07:58,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 133 transitions, 1339 flow [2021-03-26 10:07:59,110 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1072] L768-->L775: Formula: (let ((.cse8 (= (mod v_~b$w_buff0_used~0_455 256) 0)) (.cse9 (= (mod v_~b$r_buff1_thd1~0_58 256) 0)) (.cse13 (= (mod v_~b$w_buff1_used~0_360 256) 0)) (.cse12 (= (mod v_~b$r_buff0_thd1~0_71 256) 0)) (.cse14 (= (mod v_~b$w_buff0_used~0_456 256) 0))) (let ((.cse2 (or .cse12 .cse14)) (.cse0 (not .cse14)) (.cse10 (not .cse13)) (.cse7 (not .cse9)) (.cse3 (not .cse8)) (.cse1 (not .cse12)) (.cse11 (or .cse9 .cse13)) (.cse4 (or .cse12 .cse8))) (and (or (and .cse0 (= v_~b$w_buff0_used~0_455 0) .cse1) (and (= v_~b$w_buff0_used~0_456 v_~b$w_buff0_used~0_455) .cse2)) (or (and .cse3 (= v_~b$r_buff0_thd1~0_70 0) .cse1) (and .cse4 (= v_~b$r_buff0_thd1~0_71 v_~b$r_buff0_thd1~0_70))) (let ((.cse5 (= (mod v_~b$r_buff0_thd1~0_70 256) 0)) (.cse6 (= (mod v_~b$w_buff1_used~0_359 256) 0))) (or (and (= v_~b$r_buff1_thd1~0_57 0) (or (and .cse3 (not .cse5)) (and (not .cse6) .cse7))) (and (= v_~b$r_buff1_thd1~0_58 v_~b$r_buff1_thd1~0_57) (or .cse8 .cse5) (or .cse6 .cse9)))) (or (and (or (and .cse10 (= v_~b$w_buff1~0_102 |v_P0_#t~ite5_35|) .cse7) (and (= |v_P0_#t~ite5_35| v_~b~0_147) .cse11)) .cse2 (= |v_P0_#t~ite5_35| v_~b~0_146)) (and (= v_~b~0_146 v_~b$w_buff0~0_83) .cse0 .cse1 (= |v_P0_#t~ite5_35| |v_P0Thread1of1ForFork1_#t~ite5_1|))) (or (and (or (and .cse10 .cse7) (and .cse3 .cse1)) (= v_~b$w_buff1_used~0_359 0)) (and (= v_~b$w_buff1_used~0_359 v_~b$w_buff1_used~0_360) .cse11 .cse4))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_456, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_71, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_1|, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_58, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_360, ~b~0=v_~b~0_147, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} OutVars{P0Thread1of1ForFork1_#t~ite10=|v_P0Thread1of1ForFork1_#t~ite10_1|, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_70, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_57, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_455, P0Thread1of1ForFork1_#t~ite5=|v_P0Thread1of1ForFork1_#t~ite5_2|, P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_1|, P0Thread1of1ForFork1_#t~ite9=|v_P0Thread1of1ForFork1_#t~ite9_1|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_359, ~b~0=v_~b~0_146, P0Thread1of1ForFork1_#t~ite6=|v_P0Thread1of1ForFork1_#t~ite6_1|, P0Thread1of1ForFork1_#t~ite7=|v_P0Thread1of1ForFork1_#t~ite7_1|, ~b$w_buff1~0=v_~b$w_buff1~0_102, ~b$w_buff0~0=v_~b$w_buff0~0_83} AuxVars[|v_P0_#t~ite5_35|] AssignedVars[P0Thread1of1ForFork1_#t~ite10, ~b$w_buff0_used~0, ~b$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite5, ~b$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9, ~b$w_buff1_used~0, ~b~0, P0Thread1of1ForFork1_#t~ite6, P0Thread1of1ForFork1_#t~ite7][112], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 194#(<= ~__unbuffered_cnt~0 1), Black: 195#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 197#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (<= ~__unbuffered_cnt~0 1)), 139#true, 204#(= ~__unbuffered_cnt~0 0), 78#L854true, Black: 211#(and (<= ~__unbuffered_cnt~0 2) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 206#(<= ~__unbuffered_cnt~0 2), Black: 207#(and (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)) (<= ULTIMATE.start_assume_abort_if_not_~cond 0)), Black: 141#(= ~__unbuffered_p3_EAX~0 0), Black: 142#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 88#L878-1true, 218#(= ~z~0 1), 28#L815true, Black: 156#(= ~y~0 0), 95#L788true, Black: 221#(and (= ~__unbuffered_p2_EAX~0 1) (= ~z~0 1)), 225#true, Black: 227#(and (= ~b$w_buff0~0 1) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 228#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1)), Black: 229#(= ~__unbuffered_p3_EBX~0 1), Black: 231#(and (= ~b$w_buff0_used~0 (* 256 (div ~b$w_buff0_used~0 256))) (= ~b~0 1) (= ~__unbuffered_p3_EBX~0 1)), 239#(and (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd4~0 0)), 177#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 114#L775true, Black: 179#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 172#(and (= ~b$r_buff0_thd2~0 0) (= ~x~0 1)), Black: 173#(and (= ~b$r_buff0_thd2~0 0) (= ~b$w_buff0_used~0 ~x~0) (= ~b$w_buff0_used~0 1)), Black: 174#(and (= ~b$r_buff0_thd2~0 0) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 188#(= ~y~0 1), Black: 245#(and (= ~b$r_buff0_thd2~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$r_buff0_thd4~0 0) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0) (= ~b$r_buff0_thd1~0 1) (= ~b$w_buff0_used~0 1)), Black: 247#(and (= ~b$r_buff0_thd2~0 0) (= 0 ~b$r_buff1_thd4~0) (= ~b$r_buff0_thd4~0 0) (= ~b$w_buff0~0 1) (= 0 ~b$r_buff1_thd2~0) (= ~b$w_buff0~0 ~b~0)), Black: 251#(and (= ~b$r_buff0_thd2~0 0) (= ~b$r_buff0_thd4~0 0) (= ~__unbuffered_p3_EBX~0 1))]) [2021-03-26 10:07:59,110 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 10:07:59,110 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:59,110 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:59,110 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:59,616 INFO L129 PetriNetUnfolder]: 6571/14734 cut-off events. [2021-03-26 10:07:59,616 INFO L130 PetriNetUnfolder]: For 59601/62915 co-relation queries the response was YES. [2021-03-26 10:07:59,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58428 conditions, 14734 events. 6571/14734 cut-off events. For 59601/62915 co-relation queries the response was YES. Maximal size of possible extension queue 1903. Compared 168000 event pairs, 487 based on Foata normal form. 859/14835 useless extension candidates. Maximal degree in co-relation 58389. Up to 3606 conditions per place. [2021-03-26 10:07:59,895 INFO L142 LiptonReduction]: Number of co-enabled transitions 2954 [2021-03-26 10:08:00,702 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:08:00,702 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:08:00,702 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2268 [2021-03-26 10:08:00,702 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 133 transitions, 1339 flow [2021-03-26 10:08:00,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 158.14285714285714) internal successors, (1107), 7 states have internal predecessors, (1107), 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 10:08:00,703 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:08:00,703 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, 1, 1] [2021-03-26 10:08:00,703 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:08:00,703 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:08:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:08:00,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1360501834, now seen corresponding path program 2 times [2021-03-26 10:08:00,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:08:00,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585709551] [2021-03-26 10:08:00,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:08:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:08:00,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:00,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:08:00,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:00,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:08:00,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:00,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:08:00,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:00,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:08:00,759 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:08:00,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:08:00,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:00,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:08:00,764 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 10:08:00,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585709551] [2021-03-26 10:08:00,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:08:00,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:08:00,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923962897] [2021-03-26 10:08:00,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:08:00,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:08:00,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:08:00,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:08:00,766 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 214 [2021-03-26 10:08:00,767 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 133 transitions, 1339 flow. Second operand has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 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 10:08:00,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:08:00,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 214 [2021-03-26 10:08:00,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:08:02,826 INFO L129 PetriNetUnfolder]: 9626/19081 cut-off events. [2021-03-26 10:08:02,826 INFO L130 PetriNetUnfolder]: For 114898/144122 co-relation queries the response was YES. [2021-03-26 10:08:02,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79928 conditions, 19081 events. 9626/19081 cut-off events. For 114898/144122 co-relation queries the response was YES. Maximal size of possible extension queue 2603. Compared 206040 event pairs, 321 based on Foata normal form. 6154/22931 useless extension candidates. Maximal degree in co-relation 79887. Up to 5151 conditions per place. [2021-03-26 10:08:02,940 INFO L132 encePairwiseOnDemand]: 206/214 looper letters, 7 selfloop transitions, 28 changer transitions 26/139 dead transitions. [2021-03-26 10:08:02,940 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 139 transitions, 1389 flow [2021-03-26 10:08:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 10:08:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 10:08:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1822 transitions. [2021-03-26 10:08:02,943 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8514018691588785 [2021-03-26 10:08:02,943 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1822 transitions. [2021-03-26 10:08:02,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1822 transitions. [2021-03-26 10:08:02,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:08:02,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1822 transitions. [2021-03-26 10:08:02,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 182.2) internal successors, (1822), 10 states have internal predecessors, (1822), 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 10:08:02,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 214.0) internal successors, (2354), 11 states have internal predecessors, (2354), 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 10:08:02,949 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 214.0) internal successors, (2354), 11 states have internal predecessors, (2354), 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 10:08:02,949 INFO L185 Difference]: Start difference. First operand has 95 places, 133 transitions, 1339 flow. Second operand 10 states and 1822 transitions. [2021-03-26 10:08:02,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 139 transitions, 1389 flow [2021-03-26 10:08:05,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 139 transitions, 1355 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-03-26 10:08:05,526 INFO L241 Difference]: Finished difference. Result has 102 places, 110 transitions, 1045 flow [2021-03-26 10:08:05,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1045, PETRI_PLACES=102, PETRI_TRANSITIONS=110} [2021-03-26 10:08:05,526 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 41 predicate places. [2021-03-26 10:08:05,526 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:08:05,526 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 110 transitions, 1045 flow [2021-03-26 10:08:05,527 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 110 transitions, 1045 flow [2021-03-26 10:08:05,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 110 transitions, 1045 flow [2021-03-26 10:08:06,409 INFO L129 PetriNetUnfolder]: 4733/10967 cut-off events. [2021-03-26 10:08:06,409 INFO L130 PetriNetUnfolder]: For 39154/42537 co-relation queries the response was YES. [2021-03-26 10:08:06,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49567 conditions, 10967 events. 4733/10967 cut-off events. For 39154/42537 co-relation queries the response was YES. Maximal size of possible extension queue 1633. Compared 125903 event pairs, 317 based on Foata normal form. 369/10681 useless extension candidates. Maximal degree in co-relation 49528. Up to 2676 conditions per place. [2021-03-26 10:08:06,545 INFO L142 LiptonReduction]: Number of co-enabled transitions 2278 [2021-03-26 10:08:06,926 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:08:07,046 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:08:07,291 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:08:07,410 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 10:08:07,543 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:08:07,543 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:08:07,543 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2017 [2021-03-26 10:08:07,544 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 1051 flow [2021-03-26 10:08:07,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 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 10:08:07,545 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:08:07,545 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, 1, 1, 1, 1, 1, 1] [2021-03-26 10:08:07,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:08:07,545 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:08:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:08:07,545 INFO L82 PathProgramCache]: Analyzing trace with hash -782784435, now seen corresponding path program 1 times [2021-03-26 10:08:07,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:08:07,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144613839] [2021-03-26 10:08:07,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:08:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:08:07,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:07,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:08:07,639 INFO L142 QuantifierPusher]: treesize reduction 4, result has 91.1 percent of original size [2021-03-26 10:08:07,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 10:08:07,663 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-03-26 10:08:07,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-03-26 10:08:07,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:07,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:08:07,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:07,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:08:07,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:07,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:08:07,705 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 10:08:07,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144613839] [2021-03-26 10:08:07,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:08:07,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:08:07,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181263485] [2021-03-26 10:08:07,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:08:07,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:08:07,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:08:07,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:08:07,707 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 216 [2021-03-26 10:08:07,708 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 1051 flow. Second operand has 8 states, 8 states have (on average 155.125) internal successors, (1241), 8 states have internal predecessors, (1241), 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 10:08:07,708 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:08:07,708 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 216 [2021-03-26 10:08:07,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:08:08,865 INFO L129 PetriNetUnfolder]: 4876/11220 cut-off events. [2021-03-26 10:08:08,865 INFO L130 PetriNetUnfolder]: For 44671/49109 co-relation queries the response was YES. [2021-03-26 10:08:08,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52691 conditions, 11220 events. 4876/11220 cut-off events. For 44671/49109 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 127017 event pairs, 189 based on Foata normal form. 294/10865 useless extension candidates. Maximal degree in co-relation 52650. Up to 2711 conditions per place. [2021-03-26 10:08:08,921 INFO L132 encePairwiseOnDemand]: 211/216 looper letters, 36 selfloop transitions, 15 changer transitions 11/118 dead transitions. [2021-03-26 10:08:08,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 118 transitions, 1231 flow [2021-03-26 10:08:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:08:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:08:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 945 transitions. [2021-03-26 10:08:08,924 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2021-03-26 10:08:08,924 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 945 transitions. [2021-03-26 10:08:08,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 945 transitions. [2021-03-26 10:08:08,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:08:08,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 945 transitions. [2021-03-26 10:08:08,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 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 10:08:08,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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 10:08:08,926 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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 10:08:08,927 INFO L185 Difference]: Start difference. First operand has 99 places, 109 transitions, 1051 flow. Second operand 6 states and 945 transitions. [2021-03-26 10:08:08,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 118 transitions, 1231 flow [2021-03-26 10:08:10,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 118 transitions, 1126 flow, removed 25 selfloop flow, removed 10 redundant places. [2021-03-26 10:08:10,779 INFO L241 Difference]: Finished difference. Result has 96 places, 101 transitions, 916 flow [2021-03-26 10:08:10,779 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=916, PETRI_PLACES=96, PETRI_TRANSITIONS=101} [2021-03-26 10:08:10,779 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 35 predicate places. [2021-03-26 10:08:10,779 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:08:10,779 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 101 transitions, 916 flow [2021-03-26 10:08:10,779 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 101 transitions, 916 flow [2021-03-26 10:08:10,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 101 transitions, 916 flow [2021-03-26 10:08:11,069 INFO L129 PetriNetUnfolder]: 2031/4681 cut-off events. [2021-03-26 10:08:11,069 INFO L130 PetriNetUnfolder]: For 13844/14662 co-relation queries the response was YES. [2021-03-26 10:08:11,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18127 conditions, 4681 events. 2031/4681 cut-off events. For 13844/14662 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 46246 event pairs, 129 based on Foata normal form. 64/4460 useless extension candidates. Maximal degree in co-relation 18090. Up to 978 conditions per place. [2021-03-26 10:08:11,120 INFO L142 LiptonReduction]: Number of co-enabled transitions 1964 [2021-03-26 10:08:11,127 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:08:11,127 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:08:11,127 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 348 [2021-03-26 10:08:11,127 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 916 flow [2021-03-26 10:08:11,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 155.125) internal successors, (1241), 8 states have internal predecessors, (1241), 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 10:08:11,128 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:08:11,128 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, 1, 1, 1, 1, 1] [2021-03-26 10:08:11,128 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:08:11,128 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:08:11,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:08:11,128 INFO L82 PathProgramCache]: Analyzing trace with hash 98066456, now seen corresponding path program 1 times [2021-03-26 10:08:11,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:08:11,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52332376] [2021-03-26 10:08:11,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:08:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:08:11,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:11,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:08:11,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:11,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:08:11,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:08:11,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:08:11,170 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 10:08:11,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52332376] [2021-03-26 10:08:11,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:08:11,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:08:11,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764091109] [2021-03-26 10:08:11,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:08:11,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:08:11,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:08:11,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:08:11,171 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 216 [2021-03-26 10:08:11,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 916 flow. Second operand has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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 10:08:11,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:08:11,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 216 [2021-03-26 10:08:11,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:08:11,573 INFO L129 PetriNetUnfolder]: 2449/5796 cut-off events. [2021-03-26 10:08:11,573 INFO L130 PetriNetUnfolder]: For 16747/17604 co-relation queries the response was YES. [2021-03-26 10:08:11,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22208 conditions, 5796 events. 2449/5796 cut-off events. For 16747/17604 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 60453 event pairs, 219 based on Foata normal form. 96/5638 useless extension candidates. Maximal degree in co-relation 22169. Up to 1259 conditions per place. [2021-03-26 10:08:11,602 INFO L132 encePairwiseOnDemand]: 212/216 looper letters, 3 selfloop transitions, 1 changer transitions 44/100 dead transitions. [2021-03-26 10:08:11,602 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 100 transitions, 905 flow [2021-03-26 10:08:11,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:08:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:08:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 727 transitions. [2021-03-26 10:08:11,604 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8414351851851852 [2021-03-26 10:08:11,604 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 727 transitions. [2021-03-26 10:08:11,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 727 transitions. [2021-03-26 10:08:11,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:08:11,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 727 transitions. [2021-03-26 10:08:11,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 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 10:08:11,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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 10:08:11,606 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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 10:08:11,606 INFO L185 Difference]: Start difference. First operand has 95 places, 101 transitions, 916 flow. Second operand 4 states and 727 transitions. [2021-03-26 10:08:11,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 100 transitions, 905 flow [2021-03-26 10:08:12,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 100 transitions, 843 flow, removed 3 selfloop flow, removed 9 redundant places. [2021-03-26 10:08:12,128 INFO L241 Difference]: Finished difference. Result has 90 places, 56 transitions, 391 flow [2021-03-26 10:08:12,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=90, PETRI_TRANSITIONS=56} [2021-03-26 10:08:12,129 INFO L343 CegarLoopForPetriNet]: 61 programPoint places, 29 predicate places. [2021-03-26 10:08:12,129 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:08:12,129 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 56 transitions, 391 flow [2021-03-26 10:08:12,129 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 56 transitions, 391 flow [2021-03-26 10:08:12,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 56 transitions, 391 flow [2021-03-26 10:08:12,160 INFO L129 PetriNetUnfolder]: 194/473 cut-off events. [2021-03-26 10:08:12,160 INFO L130 PetriNetUnfolder]: For 1073/1113 co-relation queries the response was YES. [2021-03-26 10:08:12,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 473 events. 194/473 cut-off events. For 1073/1113 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2941 event pairs, 16 based on Foata normal form. 7/460 useless extension candidates. Maximal degree in co-relation 1681. Up to 108 conditions per place. [2021-03-26 10:08:12,164 INFO L142 LiptonReduction]: Number of co-enabled transitions 540 [2021-03-26 10:08:12,864 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 174 [2021-03-26 10:08:13,123 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2021-03-26 10:08:14,314 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 298 DAG size of output: 254 [2021-03-26 10:08:14,828 WARN L205 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-26 10:08:15,150 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:08:15,289 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:08:15,824 WARN L205 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 179 [2021-03-26 10:08:16,089 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2021-03-26 10:08:16,617 WARN L205 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 259 [2021-03-26 10:08:17,160 WARN L205 SmtUtils]: Spent 542.00 ms on a formula simplification that was a NOOP. DAG size: 259 [2021-03-26 10:08:17,323 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:08:17,689 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2021-03-26 10:08:17,807 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 10:08:17,812 INFO L154 LiptonReduction]: Checked pairs total: 100 [2021-03-26 10:08:17,812 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 10:08:17,812 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5683 [2021-03-26 10:08:17,812 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 50 transitions, 385 flow [2021-03-26 10:08:17,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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 10:08:17,813 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:08:17,813 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, 1, 1, 1, 1, 1] [2021-03-26 10:08:17,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:08:17,813 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:08:17,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:08:17,813 INFO L82 PathProgramCache]: Analyzing trace with hash -921385435, now seen corresponding path program 1 times [2021-03-26 10:08:17,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:08:17,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581851595] [2021-03-26 10:08:17,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:08:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:08:17,846 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:08:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:08:17,882 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:08:17,915 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:08:17,915 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:08:17,915 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:08:18,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:08:18 BasicIcfg [2021-03-26 10:08:18,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:08:18,004 INFO L168 Benchmark]: Toolchain (without parser) took 55533.59 ms. Allocated memory was 255.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 234.6 MB in the beginning and 2.5 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.8 GB. Max. memory is 16.0 GB. [2021-03-26 10:08:18,004 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:08:18,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.03 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 234.6 MB in the beginning and 329.3 MB in the end (delta: -94.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:08:18,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.88 ms. Allocated memory is still 371.2 MB. Free memory was 329.3 MB in the beginning and 326.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:08:18,004 INFO L168 Benchmark]: Boogie Preprocessor took 40.72 ms. Allocated memory is still 371.2 MB. Free memory was 326.5 MB in the beginning and 324.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:08:18,004 INFO L168 Benchmark]: RCFGBuilder took 1302.59 ms. Allocated memory is still 371.2 MB. Free memory was 324.4 MB in the beginning and 302.8 MB in the end (delta: 21.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:08:18,005 INFO L168 Benchmark]: TraceAbstraction took 53698.87 ms. Allocated memory was 371.2 MB in the beginning and 4.2 GB in the end (delta: 3.9 GB). Free memory was 301.8 MB in the beginning and 2.5 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. [2021-03-26 10:08:18,005 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.36 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 432.03 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 234.6 MB in the beginning and 329.3 MB in the end (delta: -94.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.88 ms. Allocated memory is still 371.2 MB. Free memory was 329.3 MB in the beginning and 326.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.72 ms. Allocated memory is still 371.2 MB. Free memory was 326.5 MB in the beginning and 324.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1302.59 ms. Allocated memory is still 371.2 MB. Free memory was 324.4 MB in the beginning and 302.8 MB in the end (delta: 21.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 53698.87 ms. Allocated memory was 371.2 MB in the beginning and 4.2 GB in the end (delta: 3.9 GB). Free memory was 301.8 MB in the beginning and 2.5 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.7 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2859.9ms, 127 PlacesBefore, 61 PlacesAfterwards, 116 TransitionsBefore, 49 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5194 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2677, positive: 2566, positive conditional: 2566, positive unconditional: 0, negative: 111, negative conditional: 111, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2677, positive: 2566, positive conditional: 0, positive unconditional: 2566, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2677, positive: 2566, positive conditional: 0, positive unconditional: 2566, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1957, positive: 1904, positive conditional: 0, positive unconditional: 1904, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1957, positive: 1887, positive conditional: 0, positive unconditional: 1887, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 560, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 523, negative conditional: 0, negative unconditional: 523, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2677, positive: 662, positive conditional: 0, positive unconditional: 662, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 1957, unknown conditional: 0, unknown unconditional: 1957] , Statistics on independence cache: Total cache size (in pairs): 1957, Positive cache size: 1904, Positive conditional cache size: 0, Positive unconditional cache size: 1904, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 856.2ms, 57 PlacesBefore, 45 PlacesAfterwards, 46 TransitionsBefore, 34 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2761 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 969, positive: 845, positive conditional: 845, positive unconditional: 0, negative: 124, negative conditional: 124, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 969, positive: 845, positive conditional: 46, positive unconditional: 799, negative: 124, negative conditional: 4, negative unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 969, positive: 845, positive conditional: 46, positive unconditional: 799, negative: 124, negative conditional: 4, negative unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 243, positive: 222, positive conditional: 13, positive unconditional: 209, negative: 21, negative conditional: 1, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 243, positive: 207, positive conditional: 0, positive unconditional: 207, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 21, negative conditional: 1, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 196, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 153, negative conditional: 13, negative unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 969, positive: 623, positive conditional: 33, positive unconditional: 590, negative: 103, negative conditional: 3, negative unconditional: 100, unknown: 243, unknown conditional: 14, unknown unconditional: 229] , Statistics on independence cache: Total cache size (in pairs): 2200, Positive cache size: 2126, Positive conditional cache size: 13, Positive unconditional cache size: 2113, Negative cache size: 74, Negative conditional cache size: 1, Negative unconditional cache size: 73, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 600.9ms, 54 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 35 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1125 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 409, positive: 358, positive conditional: 358, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 409, positive: 358, positive conditional: 0, positive unconditional: 358, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 409, positive: 358, positive conditional: 0, positive unconditional: 358, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 409, positive: 348, positive conditional: 0, positive unconditional: 348, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 2210, Positive cache size: 2136, Positive conditional cache size: 13, Positive unconditional cache size: 2123, Negative cache size: 74, Negative conditional cache size: 1, Negative unconditional cache size: 73, Eliminated conditions: 56 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 980.9ms, 47 PlacesBefore, 46 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 978 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 380, positive: 338, positive conditional: 338, 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: 380, positive: 338, positive conditional: 0, positive unconditional: 338, 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: 380, positive: 338, positive conditional: 0, positive unconditional: 338, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 380, positive: 334, positive conditional: 0, positive unconditional: 334, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 2215, Positive cache size: 2140, Positive conditional cache size: 13, Positive unconditional cache size: 2127, Negative cache size: 75, Negative conditional cache size: 1, Negative unconditional cache size: 74, Eliminated conditions: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 379.1ms, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 844 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1146 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 220, positive: 182, positive conditional: 182, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 220, positive: 182, positive conditional: 36, positive unconditional: 146, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 220, positive: 182, positive conditional: 36, positive unconditional: 146, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 7, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 115, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 115, negative conditional: 0, negative unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 220, positive: 173, positive conditional: 29, positive unconditional: 144, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 14, unknown conditional: 7, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 2229, Positive cache size: 2149, Positive conditional cache size: 20, Positive unconditional cache size: 2129, Negative cache size: 80, Negative conditional cache size: 1, Negative unconditional cache size: 79, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4156.4ms, 60 PlacesBefore, 60 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 398 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, positive: 24, positive conditional: 6, positive unconditional: 18, negative: 8, negative conditional: 7, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 24, positive conditional: 6, positive unconditional: 18, negative: 8, negative conditional: 7, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 37, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 24, positive conditional: 6, positive unconditional: 18, negative: 6, negative conditional: 5, negative unconditional: 1, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2231, Positive cache size: 2149, Positive conditional cache size: 20, Positive unconditional cache size: 2129, Negative cache size: 82, Negative conditional cache size: 3, Negative unconditional cache size: 79, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3990.4ms, 62 PlacesBefore, 62 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 347 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, positive: 24, positive conditional: 6, positive unconditional: 18, negative: 7, negative conditional: 6, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, positive: 24, positive conditional: 6, positive unconditional: 18, negative: 7, negative conditional: 6, negative unconditional: 1, 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: 31, positive: 24, positive conditional: 6, positive unconditional: 18, negative: 7, negative conditional: 6, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2231, Positive cache size: 2149, Positive conditional cache size: 20, Positive unconditional cache size: 2129, Negative cache size: 82, Negative conditional cache size: 3, Negative unconditional cache size: 79, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1226.7ms, 69 PlacesBefore, 69 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 1812 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 454 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, positive: 18, positive conditional: 6, positive unconditional: 12, negative: 8, negative conditional: 7, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 6, positive unconditional: 12, negative: 8, negative conditional: 7, negative unconditional: 1, 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: 26, positive: 18, positive conditional: 6, positive unconditional: 12, negative: 8, negative conditional: 7, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2231, Positive cache size: 2149, Positive conditional cache size: 20, Positive unconditional cache size: 2129, Negative cache size: 82, Negative conditional cache size: 3, Negative unconditional cache size: 79, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1692.5ms, 77 PlacesBefore, 77 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 1986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 467 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, positive: 38, positive conditional: 20, positive unconditional: 18, negative: 8, negative conditional: 6, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 38, positive conditional: 20, positive unconditional: 18, negative: 8, negative conditional: 6, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 1, positive unconditional: 4, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 33, positive conditional: 19, positive unconditional: 14, negative: 8, negative conditional: 6, negative unconditional: 2, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 2236, Positive cache size: 2154, Positive conditional cache size: 21, Positive unconditional cache size: 2133, Negative cache size: 82, Negative conditional cache size: 3, Negative unconditional cache size: 79, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4079.5ms, 78 PlacesBefore, 78 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 2036 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 425 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, positive: 59, positive conditional: 37, positive unconditional: 22, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 59, positive conditional: 37, positive unconditional: 22, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 65, positive: 56, positive conditional: 34, positive unconditional: 22, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2239, Positive cache size: 2157, Positive conditional cache size: 24, Positive unconditional cache size: 2133, Negative cache size: 82, Negative conditional cache size: 3, Negative unconditional cache size: 79, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1452.0ms, 86 PlacesBefore, 86 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 2716 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 2239, Positive cache size: 2157, Positive conditional cache size: 24, Positive unconditional cache size: 2133, Negative cache size: 82, Negative conditional cache size: 3, Negative unconditional cache size: 79, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2267.4ms, 95 PlacesBefore, 95 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 2954 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 2239, Positive cache size: 2157, Positive conditional cache size: 24, Positive unconditional cache size: 2133, Negative cache size: 82, Negative conditional cache size: 3, Negative unconditional cache size: 79, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2016.6ms, 102 PlacesBefore, 99 PlacesAfterwards, 110 TransitionsBefore, 109 TransitionsAfterwards, 2278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 2239, Positive cache size: 2157, Positive conditional cache size: 24, Positive unconditional cache size: 2133, Negative cache size: 82, Negative conditional cache size: 3, Negative unconditional cache size: 79, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 347.6ms, 96 PlacesBefore, 95 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 1964 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 2239, Positive cache size: 2157, Positive conditional cache size: 24, Positive unconditional cache size: 2133, Negative cache size: 82, Negative conditional cache size: 3, Negative unconditional cache size: 79, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5682.7ms, 90 PlacesBefore, 78 PlacesAfterwards, 56 TransitionsBefore, 50 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 100 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, positive: 100, positive conditional: 81, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, positive: 100, positive conditional: 81, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 23, positive unconditional: 3, 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: 26, positive: 26, positive conditional: 0, positive unconditional: 26, 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: 100, positive: 74, positive conditional: 58, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 26, unknown conditional: 23, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2265, Positive cache size: 2183, Positive conditional cache size: 47, Positive unconditional cache size: 2136, Negative cache size: 82, Negative conditional cache size: 3, Negative unconditional cache size: 79, Eliminated conditions: 14 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1025; [L872] FCALL, FORK 0 pthread_create(&t1025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1026; [L874] FCALL, FORK 0 pthread_create(&t1026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t1027; [L876] FCALL, FORK 0 pthread_create(&t1027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L877] 0 pthread_t t1028; [L878] FCALL, FORK 0 pthread_create(&t1028, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 53525.5ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 19541.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2934.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 96 SDtfs, 110 SDslu, 89 SDs, 0 SdLazy, 567 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 486.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 371.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1339occurred in iteration=11, InterpolantAutomatonStates: 80, 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: 38.4ms SsaConstructionTime, 336.9ms SatisfiabilityAnalysisTime, 704.3ms InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 284 ConstructedInterpolants, 0 QuantifiedInterpolants, 1853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...