/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:30:05,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:30:05,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:30:05,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:30:05,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:30:05,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:30:05,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:30:05,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:30:05,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:30:05,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:30:05,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:30:05,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:30:05,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:30:05,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:30:05,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:30:05,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:30:05,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:30:05,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:30:05,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:30:05,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:30:05,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:30:05,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:30:05,246 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:30:05,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:30:05,248 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:30:05,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:30:05,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:30:05,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:30:05,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:30:05,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:30:05,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:30:05,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:30:05,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:30:05,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:30:05,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:30:05,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:30:05,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:30:05,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:30:05,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:30:05,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:30:05,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:30:05,296 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-RepeatedSemanticLbe.epf [2021-03-25 14:30:05,325 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:30:05,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:30:05,328 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:30:05,328 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:30:05,328 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:30:05,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:30:05,328 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:30:05,328 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:30:05,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:30:05,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:30:05,329 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:30:05,329 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:30:05,329 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:30:05,329 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:30:05,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:30:05,329 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:30:05,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:30:05,330 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:30:05,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:30:05,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:30:05,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:30:05,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:30:05,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:30:05,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:30:05,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:30:05,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:30:05,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:30:05,331 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:30:05,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:30:05,331 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-25 14:30:05,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:30:05,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:30:05,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:30:05,590 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:30:05,595 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:30:05,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i [2021-03-25 14:30:05,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7732d1438/1f302bc9fce14c8a851f827682a13f7d/FLAGd40c34a67 [2021-03-25 14:30:06,084 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:30:06,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i [2021-03-25 14:30:06,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7732d1438/1f302bc9fce14c8a851f827682a13f7d/FLAGd40c34a67 [2021-03-25 14:30:06,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7732d1438/1f302bc9fce14c8a851f827682a13f7d [2021-03-25 14:30:06,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:30:06,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:30:06,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:30:06,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:30:06,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:30:06,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337a145c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06, skipping insertion in model container [2021-03-25 14:30:06,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:30:06,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:30:06,248 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/mix036_tso.opt.i[948,961] [2021-03-25 14:30:06,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:30:06,351 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:30:06,358 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/mix036_tso.opt.i[948,961] [2021-03-25 14:30:06,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:30:06,433 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:30:06,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06 WrapperNode [2021-03-25 14:30:06,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:30:06,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:30:06,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:30:06,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:30:06,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:30:06,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:30:06,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:30:06,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:30:06,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (1/1) ... [2021-03-25 14:30:06,488 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:30:06,489 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:30:06,489 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:30:06,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:30:06,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (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-25 14:30:06,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:30:06,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:30:06,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:30:06,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:30:06,544 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:30:06,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:30:06,544 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:30:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:30:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:30:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:30:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:30:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:30:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:30:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:30:06,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:30:06,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:30:06,546 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:30:07,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:30:07,691 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:30:07,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:30:07 BoogieIcfgContainer [2021-03-25 14:30:07,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:30:07,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:30:07,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:30:07,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:30:07,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:30:06" (1/3) ... [2021-03-25 14:30:07,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4c46d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:30:07, skipping insertion in model container [2021-03-25 14:30:07,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:30:06" (2/3) ... [2021-03-25 14:30:07,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4c46d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:30:07, skipping insertion in model container [2021-03-25 14:30:07,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:30:07" (3/3) ... [2021-03-25 14:30:07,700 INFO L111 eAbstractionObserver]: Analyzing ICFG mix036_tso.opt.i [2021-03-25 14:30:07,703 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:30:07,707 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:30:07,707 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:30:07,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,737 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,737 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,737 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,737 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,738 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,760 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,760 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,762 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,763 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,764 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,766 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,767 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,767 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,769 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,769 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:30:07,776 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:30:07,787 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:30:07,808 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:30:07,808 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:30:07,808 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:30:07,808 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:30:07,808 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:30:07,808 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:30:07,808 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:30:07,808 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:30:07,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 118 transitions, 256 flow [2021-03-25 14:30:07,861 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-25 14:30:07,861 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:30:07,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-25 14:30:07,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 118 transitions, 256 flow [2021-03-25 14:30:07,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 114 transitions, 240 flow [2021-03-25 14:30:07,876 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:07,884 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-25 14:30:07,886 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 114 transitions, 240 flow [2021-03-25 14:30:07,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 240 flow [2021-03-25 14:30:07,913 INFO L129 PetriNetUnfolder]: 2/114 cut-off events. [2021-03-25 14:30:07,913 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:30:07,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-25 14:30:07,917 INFO L142 LiptonReduction]: Number of co-enabled transitions 2488 [2021-03-25 14:30:08,809 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:30:09,204 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:30:09,345 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:30:10,562 INFO L154 LiptonReduction]: Checked pairs total: 3568 [2021-03-25 14:30:10,562 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-25 14:30:10,563 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2687 [2021-03-25 14:30:10,571 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-03-25 14:30:10,572 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:30:10,572 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:10,572 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-25 14:30:10,572 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:10,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1849953467, now seen corresponding path program 1 times [2021-03-25 14:30:10,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:10,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463861406] [2021-03-25 14:30:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:10,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:10,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:30:10,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:10,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:10,753 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-25 14:30:10,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463861406] [2021-03-25 14:30:10,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:10,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:30:10,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003101877] [2021-03-25 14:30:10,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:30:10,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:10,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:30:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:30:10,769 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 194 [2021-03-25 14:30:10,773 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-25 14:30:10,773 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:10,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 194 [2021-03-25 14:30:10,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:10,808 INFO L129 PetriNetUnfolder]: 9/87 cut-off events. [2021-03-25 14:30:10,808 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:30:10,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 87 events. 9/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 229 event pairs, 3 based on Foata normal form. 5/85 useless extension candidates. Maximal degree in co-relation 99. Up to 17 conditions per place. [2021-03-25 14:30:10,810 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 5 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2021-03-25 14:30:10,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 116 flow [2021-03-25 14:30:10,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:30:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:30:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-25 14:30:10,823 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9192439862542955 [2021-03-25 14:30:10,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-25 14:30:10,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-25 14:30:10,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:10,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-25 14:30:10,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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-25 14:30:10,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-25 14:30:10,840 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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-25 14:30:10,842 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 535 transitions. [2021-03-25 14:30:10,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 116 flow [2021-03-25 14:30:10,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:30:10,845 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 98 flow [2021-03-25 14:30:10,846 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-25 14:30:10,847 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-25 14:30:10,847 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:10,847 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-25 14:30:10,848 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-25 14:30:10,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2021-03-25 14:30:10,872 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-25 14:30:10,872 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:30:10,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:30:10,873 INFO L142 LiptonReduction]: Number of co-enabled transitions 468 [2021-03-25 14:30:12,560 INFO L154 LiptonReduction]: Checked pairs total: 2256 [2021-03-25 14:30:12,560 INFO L156 LiptonReduction]: Total number of compositions: 16 [2021-03-25 14:30:12,560 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1713 [2021-03-25 14:30:12,561 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-25 14:30:12,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-25 14:30:12,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:12,562 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] [2021-03-25 14:30:12,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:30:12,562 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:12,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:12,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1572757348, now seen corresponding path program 1 times [2021-03-25 14:30:12,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:12,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632662948] [2021-03-25 14:30:12,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:12,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:12,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:30:12,655 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:30:12,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:30:12,662 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:30:12,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:30:12,665 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-25 14:30:12,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632662948] [2021-03-25 14:30:12,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:12,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:30:12,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529107047] [2021-03-25 14:30:12,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:30:12,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:12,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:30:12,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:30:12,668 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 210 [2021-03-25 14:30:12,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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-25 14:30:12,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:12,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 210 [2021-03-25 14:30:12,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:12,762 INFO L129 PetriNetUnfolder]: 154/334 cut-off events. [2021-03-25 14:30:12,762 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:30:12,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 334 events. 154/334 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1698 event pairs, 47 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 585. Up to 124 conditions per place. [2021-03-25 14:30:12,767 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 6 selfloop transitions, 5 changer transitions 12/42 dead transitions. [2021-03-25 14:30:12,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 142 flow [2021-03-25 14:30:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:30:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:30:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 879 transitions. [2021-03-25 14:30:12,769 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8371428571428572 [2021-03-25 14:30:12,769 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 879 transitions. [2021-03-25 14:30:12,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 879 transitions. [2021-03-25 14:30:12,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:12,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 879 transitions. [2021-03-25 14:30:12,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 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-25 14:30:12,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-25 14:30:12,779 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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-25 14:30:12,779 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 5 states and 879 transitions. [2021-03-25 14:30:12,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 142 flow [2021-03-25 14:30:12,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:30:12,780 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 103 flow [2021-03-25 14:30:12,781 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2021-03-25 14:30:12,781 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -16 predicate places. [2021-03-25 14:30:12,781 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:12,781 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 103 flow [2021-03-25 14:30:12,781 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 103 flow [2021-03-25 14:30:12,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 103 flow [2021-03-25 14:30:12,799 INFO L129 PetriNetUnfolder]: 74/169 cut-off events. [2021-03-25 14:30:12,799 INFO L130 PetriNetUnfolder]: For 46/50 co-relation queries the response was YES. [2021-03-25 14:30:12,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 169 events. 74/169 cut-off events. For 46/50 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 701 event pairs, 52 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 377. Up to 108 conditions per place. [2021-03-25 14:30:12,802 INFO L142 LiptonReduction]: Number of co-enabled transitions 334 [2021-03-25 14:30:13,131 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-25 14:30:13,256 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-25 14:30:13,548 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-25 14:30:13,683 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-25 14:30:13,722 INFO L154 LiptonReduction]: Checked pairs total: 324 [2021-03-25 14:30:13,722 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:30:13,723 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 942 [2021-03-25 14:30:13,723 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 101 flow [2021-03-25 14:30:13,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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-25 14:30:13,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:13,724 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:30:13,724 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:30:13,724 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:13,724 INFO L82 PathProgramCache]: Analyzing trace with hash 247569013, now seen corresponding path program 1 times [2021-03-25 14:30:13,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:13,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282702240] [2021-03-25 14:30:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:13,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:13,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:13,816 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:30:13,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:30:13,823 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-25 14:30:13,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282702240] [2021-03-25 14:30:13,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:13,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:30:13,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399792877] [2021-03-25 14:30:13,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:30:13,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:13,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:30:13,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:30:13,825 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 211 [2021-03-25 14:30:13,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 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-25 14:30:13,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:13,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 211 [2021-03-25 14:30:13,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:13,852 INFO L129 PetriNetUnfolder]: 61/153 cut-off events. [2021-03-25 14:30:13,852 INFO L130 PetriNetUnfolder]: For 92/161 co-relation queries the response was YES. [2021-03-25 14:30:13,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 153 events. 61/153 cut-off events. For 92/161 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 574 event pairs, 9 based on Foata normal form. 2/151 useless extension candidates. Maximal degree in co-relation 425. Up to 89 conditions per place. [2021-03-25 14:30:13,853 INFO L132 encePairwiseOnDemand]: 208/211 looper letters, 11 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-03-25 14:30:13,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 147 flow [2021-03-25 14:30:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:30:13,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:30:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2021-03-25 14:30:13,855 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8467614533965245 [2021-03-25 14:30:13,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 536 transitions. [2021-03-25 14:30:13,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 536 transitions. [2021-03-25 14:30:13,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:13,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 536 transitions. [2021-03-25 14:30:13,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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-25 14:30:13,858 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-25 14:30:13,858 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-25 14:30:13,858 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 101 flow. Second operand 3 states and 536 transitions. [2021-03-25 14:30:13,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 147 flow [2021-03-25 14:30:13,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:30:13,859 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 107 flow [2021-03-25 14:30:13,859 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-25 14:30:13,860 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -18 predicate places. [2021-03-25 14:30:13,860 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:13,860 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 107 flow [2021-03-25 14:30:13,860 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 107 flow [2021-03-25 14:30:13,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 107 flow [2021-03-25 14:30:13,873 INFO L129 PetriNetUnfolder]: 60/153 cut-off events. [2021-03-25 14:30:13,873 INFO L130 PetriNetUnfolder]: For 62/72 co-relation queries the response was YES. [2021-03-25 14:30:13,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 153 events. 60/153 cut-off events. For 62/72 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 626 event pairs, 49 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 351. Up to 85 conditions per place. [2021-03-25 14:30:13,875 INFO L142 LiptonReduction]: Number of co-enabled transitions 332 [2021-03-25 14:30:13,881 INFO L154 LiptonReduction]: Checked pairs total: 176 [2021-03-25 14:30:13,882 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:30:13,882 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-25 14:30:13,885 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 107 flow [2021-03-25 14:30:13,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 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-25 14:30:13,886 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:13,886 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:30:13,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:30:13,886 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:13,887 INFO L82 PathProgramCache]: Analyzing trace with hash 85516770, now seen corresponding path program 1 times [2021-03-25 14:30:13,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:13,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641284130] [2021-03-25 14:30:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:13,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:13,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:13,940 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:30:13,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:30:13,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:13,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:30:13,946 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-25 14:30:13,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641284130] [2021-03-25 14:30:13,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:13,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:30:13,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614993932] [2021-03-25 14:30:13,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:30:13,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:13,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:30:13,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:30:13,948 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 211 [2021-03-25 14:30:13,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 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-25 14:30:13,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:13,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 211 [2021-03-25 14:30:13,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:14,049 INFO L129 PetriNetUnfolder]: 328/636 cut-off events. [2021-03-25 14:30:14,050 INFO L130 PetriNetUnfolder]: For 142/153 co-relation queries the response was YES. [2021-03-25 14:30:14,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 636 events. 328/636 cut-off events. For 142/153 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3870 event pairs, 152 based on Foata normal form. 51/608 useless extension candidates. Maximal degree in co-relation 1419. Up to 360 conditions per place. [2021-03-25 14:30:14,056 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 10 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2021-03-25 14:30:14,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 173 flow [2021-03-25 14:30:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:30:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:30:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 902 transitions. [2021-03-25 14:30:14,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8549763033175355 [2021-03-25 14:30:14,058 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 902 transitions. [2021-03-25 14:30:14,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 902 transitions. [2021-03-25 14:30:14,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:14,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 902 transitions. [2021-03-25 14:30:14,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.4) internal successors, (902), 5 states have internal predecessors, (902), 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-25 14:30:14,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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-25 14:30:14,062 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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-25 14:30:14,062 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 107 flow. Second operand 5 states and 902 transitions. [2021-03-25 14:30:14,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 173 flow [2021-03-25 14:30:14,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:30:14,064 INFO L241 Difference]: Finished difference. Result has 45 places, 38 transitions, 176 flow [2021-03-25 14:30:14,064 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2021-03-25 14:30:14,065 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -13 predicate places. [2021-03-25 14:30:14,065 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:14,065 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 176 flow [2021-03-25 14:30:14,065 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 176 flow [2021-03-25 14:30:14,065 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 176 flow [2021-03-25 14:30:14,110 INFO L129 PetriNetUnfolder]: 337/653 cut-off events. [2021-03-25 14:30:14,110 INFO L130 PetriNetUnfolder]: For 443/619 co-relation queries the response was YES. [2021-03-25 14:30:14,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 653 events. 337/653 cut-off events. For 443/619 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 4085 event pairs, 183 based on Foata normal form. 4/578 useless extension candidates. Maximal degree in co-relation 1869. Up to 392 conditions per place. [2021-03-25 14:30:14,117 INFO L142 LiptonReduction]: Number of co-enabled transitions 456 [2021-03-25 14:30:14,134 INFO L154 LiptonReduction]: Checked pairs total: 366 [2021-03-25 14:30:14,135 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:30:14,135 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 70 [2021-03-25 14:30:14,136 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 170 flow [2021-03-25 14:30:14,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 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-25 14:30:14,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:14,137 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:30:14,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:30:14,137 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1715415062, now seen corresponding path program 1 times [2021-03-25 14:30:14,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:14,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226555643] [2021-03-25 14:30:14,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:14,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:14,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:14,202 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:30:14,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:30:14,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:30:14,209 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-25 14:30:14,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226555643] [2021-03-25 14:30:14,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:14,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:30:14,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674645511] [2021-03-25 14:30:14,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:30:14,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:14,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:30:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:30:14,214 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 211 [2021-03-25 14:30:14,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 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-25 14:30:14,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:14,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 211 [2021-03-25 14:30:14,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:14,286 INFO L129 PetriNetUnfolder]: 192/428 cut-off events. [2021-03-25 14:30:14,286 INFO L130 PetriNetUnfolder]: For 443/864 co-relation queries the response was YES. [2021-03-25 14:30:14,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 428 events. 192/428 cut-off events. For 443/864 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2379 event pairs, 49 based on Foata normal form. 100/501 useless extension candidates. Maximal degree in co-relation 1498. Up to 277 conditions per place. [2021-03-25 14:30:14,290 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 10 selfloop transitions, 14 changer transitions 0/46 dead transitions. [2021-03-25 14:30:14,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 270 flow [2021-03-25 14:30:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:30:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:30:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1082 transitions. [2021-03-25 14:30:14,293 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8546603475513428 [2021-03-25 14:30:14,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1082 transitions. [2021-03-25 14:30:14,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1082 transitions. [2021-03-25 14:30:14,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:14,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1082 transitions. [2021-03-25 14:30:14,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.33333333333334) internal successors, (1082), 6 states have internal predecessors, (1082), 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-25 14:30:14,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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-25 14:30:14,298 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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-25 14:30:14,298 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 170 flow. Second operand 6 states and 1082 transitions. [2021-03-25 14:30:14,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 270 flow [2021-03-25 14:30:14,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 263 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:30:14,303 INFO L241 Difference]: Finished difference. Result has 49 places, 42 transitions, 259 flow [2021-03-25 14:30:14,303 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=259, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2021-03-25 14:30:14,304 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2021-03-25 14:30:14,304 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:14,304 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 42 transitions, 259 flow [2021-03-25 14:30:14,304 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 42 transitions, 259 flow [2021-03-25 14:30:14,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 42 transitions, 259 flow [2021-03-25 14:30:14,331 INFO L129 PetriNetUnfolder]: 190/427 cut-off events. [2021-03-25 14:30:14,331 INFO L130 PetriNetUnfolder]: For 785/1057 co-relation queries the response was YES. [2021-03-25 14:30:14,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 427 events. 190/427 cut-off events. For 785/1057 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2557 event pairs, 60 based on Foata normal form. 14/411 useless extension candidates. Maximal degree in co-relation 1729. Up to 288 conditions per place. [2021-03-25 14:30:14,336 INFO L142 LiptonReduction]: Number of co-enabled transitions 520 [2021-03-25 14:30:14,362 INFO L154 LiptonReduction]: Checked pairs total: 410 [2021-03-25 14:30:14,363 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:30:14,363 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-25 14:30:14,365 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 251 flow [2021-03-25 14:30:14,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 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-25 14:30:14,366 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:14,366 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:30:14,366 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:30:14,366 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:14,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:14,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1761591547, now seen corresponding path program 1 times [2021-03-25 14:30:14,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:14,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340652219] [2021-03-25 14:30:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:14,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:14,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:14,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:14,431 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:30:14,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:30:14,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:30:14,438 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-25 14:30:14,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340652219] [2021-03-25 14:30:14,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:14,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:30:14,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726968060] [2021-03-25 14:30:14,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:30:14,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:14,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:30:14,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:30:14,441 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 211 [2021-03-25 14:30:14,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 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-25 14:30:14,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:14,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 211 [2021-03-25 14:30:14,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:14,503 INFO L129 PetriNetUnfolder]: 100/250 cut-off events. [2021-03-25 14:30:14,503 INFO L130 PetriNetUnfolder]: For 682/1077 co-relation queries the response was YES. [2021-03-25 14:30:14,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 250 events. 100/250 cut-off events. For 682/1077 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1137 event pairs, 15 based on Foata normal form. 107/344 useless extension candidates. Maximal degree in co-relation 1102. Up to 159 conditions per place. [2021-03-25 14:30:14,505 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 6 selfloop transitions, 18 changer transitions 4/50 dead transitions. [2021-03-25 14:30:14,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 393 flow [2021-03-25 14:30:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:30:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:30:14,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1262 transitions. [2021-03-25 14:30:14,508 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8544346648612051 [2021-03-25 14:30:14,508 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1262 transitions. [2021-03-25 14:30:14,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1262 transitions. [2021-03-25 14:30:14,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:14,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1262 transitions. [2021-03-25 14:30:14,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 180.28571428571428) internal successors, (1262), 7 states have internal predecessors, (1262), 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-25 14:30:14,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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-25 14:30:14,513 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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-25 14:30:14,513 INFO L185 Difference]: Start difference. First operand has 49 places, 41 transitions, 251 flow. Second operand 7 states and 1262 transitions. [2021-03-25 14:30:14,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 393 flow [2021-03-25 14:30:14,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 331 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-25 14:30:14,517 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 311 flow [2021-03-25 14:30:14,517 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2021-03-25 14:30:14,518 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2021-03-25 14:30:14,518 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:14,518 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 311 flow [2021-03-25 14:30:14,518 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 311 flow [2021-03-25 14:30:14,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 311 flow [2021-03-25 14:30:14,535 INFO L129 PetriNetUnfolder]: 97/244 cut-off events. [2021-03-25 14:30:14,535 INFO L130 PetriNetUnfolder]: For 507/575 co-relation queries the response was YES. [2021-03-25 14:30:14,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 244 events. 97/244 cut-off events. For 507/575 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1186 event pairs, 23 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 958. Up to 137 conditions per place. [2021-03-25 14:30:14,537 INFO L142 LiptonReduction]: Number of co-enabled transitions 520 [2021-03-25 14:30:14,547 INFO L154 LiptonReduction]: Checked pairs total: 367 [2021-03-25 14:30:14,548 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:30:14,548 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-25 14:30:14,549 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 301 flow [2021-03-25 14:30:14,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 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-25 14:30:14,549 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:14,549 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:30:14,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:30:14,550 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2127197009, now seen corresponding path program 1 times [2021-03-25 14:30:14,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:14,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926468391] [2021-03-25 14:30:14,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:14,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:14,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:14,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:14,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:14,640 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:30:14,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:30:14,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:14,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:30:14,648 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-25 14:30:14,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926468391] [2021-03-25 14:30:14,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:14,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:30:14,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656285858] [2021-03-25 14:30:14,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:30:14,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:30:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:30:14,650 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 211 [2021-03-25 14:30:14,651 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 301 flow. Second operand has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 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-25 14:30:14,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:14,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 211 [2021-03-25 14:30:14,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:14,726 INFO L129 PetriNetUnfolder]: 73/178 cut-off events. [2021-03-25 14:30:14,726 INFO L130 PetriNetUnfolder]: For 495/697 co-relation queries the response was YES. [2021-03-25 14:30:14,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 178 events. 73/178 cut-off events. For 495/697 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 671 event pairs, 11 based on Foata normal form. 65/230 useless extension candidates. Maximal degree in co-relation 716. Up to 86 conditions per place. [2021-03-25 14:30:14,728 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 2 selfloop transitions, 18 changer transitions 4/46 dead transitions. [2021-03-25 14:30:14,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 349 flow [2021-03-25 14:30:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:30:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:30:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1434 transitions. [2021-03-25 14:30:14,730 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8495260663507109 [2021-03-25 14:30:14,731 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1434 transitions. [2021-03-25 14:30:14,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1434 transitions. [2021-03-25 14:30:14,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:14,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1434 transitions. [2021-03-25 14:30:14,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 179.25) internal successors, (1434), 8 states have internal predecessors, (1434), 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-25 14:30:14,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 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-25 14:30:14,737 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 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-25 14:30:14,737 INFO L185 Difference]: Start difference. First operand has 52 places, 45 transitions, 301 flow. Second operand 8 states and 1434 transitions. [2021-03-25 14:30:14,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 349 flow [2021-03-25 14:30:14,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 301 flow, removed 16 selfloop flow, removed 5 redundant places. [2021-03-25 14:30:14,741 INFO L241 Difference]: Finished difference. Result has 55 places, 42 transitions, 265 flow [2021-03-25 14:30:14,741 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=265, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2021-03-25 14:30:14,741 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2021-03-25 14:30:14,741 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:14,741 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 265 flow [2021-03-25 14:30:14,741 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 265 flow [2021-03-25 14:30:14,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 42 transitions, 265 flow [2021-03-25 14:30:14,754 INFO L129 PetriNetUnfolder]: 70/171 cut-off events. [2021-03-25 14:30:14,754 INFO L130 PetriNetUnfolder]: For 280/308 co-relation queries the response was YES. [2021-03-25 14:30:14,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 171 events. 70/171 cut-off events. For 280/308 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 710 event pairs, 18 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 610. Up to 58 conditions per place. [2021-03-25 14:30:14,756 INFO L142 LiptonReduction]: Number of co-enabled transitions 402 [2021-03-25 14:30:15,073 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-25 14:30:15,358 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 14:30:15,476 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2021-03-25 14:30:15,481 INFO L154 LiptonReduction]: Checked pairs total: 398 [2021-03-25 14:30:15,481 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:30:15,481 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 740 [2021-03-25 14:30:15,482 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 249 flow [2021-03-25 14:30:15,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 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-25 14:30:15,482 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:15,482 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] [2021-03-25 14:30:15,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:30:15,483 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:15,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:15,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1848331808, now seen corresponding path program 1 times [2021-03-25 14:30:15,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:15,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220832227] [2021-03-25 14:30:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:15,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:15,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:30:15,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:15,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:15,547 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:30:15,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:30:15,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-25 14:30:15,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220832227] [2021-03-25 14:30:15,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:15,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:30:15,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729315360] [2021-03-25 14:30:15,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:30:15,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:15,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:30:15,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:30:15,555 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 214 [2021-03-25 14:30:15,556 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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-25 14:30:15,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:15,556 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 214 [2021-03-25 14:30:15,556 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:15,602 INFO L129 PetriNetUnfolder]: 127/285 cut-off events. [2021-03-25 14:30:15,603 INFO L130 PetriNetUnfolder]: For 498/703 co-relation queries the response was YES. [2021-03-25 14:30:15,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 285 events. 127/285 cut-off events. For 498/703 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1391 event pairs, 9 based on Foata normal form. 41/309 useless extension candidates. Maximal degree in co-relation 1064. Up to 86 conditions per place. [2021-03-25 14:30:15,605 INFO L132 encePairwiseOnDemand]: 205/214 looper letters, 8 selfloop transitions, 15 changer transitions 0/50 dead transitions. [2021-03-25 14:30:15,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 349 flow [2021-03-25 14:30:15,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:30:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:30:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 876 transitions. [2021-03-25 14:30:15,607 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8186915887850468 [2021-03-25 14:30:15,607 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 876 transitions. [2021-03-25 14:30:15,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 876 transitions. [2021-03-25 14:30:15,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:15,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 876 transitions. [2021-03-25 14:30:15,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.2) internal successors, (876), 5 states have internal predecessors, (876), 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-25 14:30:15,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 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-25 14:30:15,610 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 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-25 14:30:15,610 INFO L185 Difference]: Start difference. First operand has 51 places, 39 transitions, 249 flow. Second operand 5 states and 876 transitions. [2021-03-25 14:30:15,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 349 flow [2021-03-25 14:30:15,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 280 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-03-25 14:30:15,614 INFO L241 Difference]: Finished difference. Result has 49 places, 48 transitions, 284 flow [2021-03-25 14:30:15,614 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=284, PETRI_PLACES=49, PETRI_TRANSITIONS=48} [2021-03-25 14:30:15,614 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2021-03-25 14:30:15,614 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:15,615 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 48 transitions, 284 flow [2021-03-25 14:30:15,615 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 48 transitions, 284 flow [2021-03-25 14:30:15,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 48 transitions, 284 flow [2021-03-25 14:30:15,632 INFO L129 PetriNetUnfolder]: 115/261 cut-off events. [2021-03-25 14:30:15,632 INFO L130 PetriNetUnfolder]: For 290/360 co-relation queries the response was YES. [2021-03-25 14:30:15,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 261 events. 115/261 cut-off events. For 290/360 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1299 event pairs, 8 based on Foata normal form. 16/260 useless extension candidates. Maximal degree in co-relation 818. Up to 74 conditions per place. [2021-03-25 14:30:15,635 INFO L142 LiptonReduction]: Number of co-enabled transitions 502 [2021-03-25 14:30:15,638 INFO L154 LiptonReduction]: Checked pairs total: 263 [2021-03-25 14:30:15,639 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:30:15,639 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-25 14:30:15,639 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 284 flow [2021-03-25 14:30:15,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 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-25 14:30:15,639 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:15,639 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:30:15,640 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:30:15,640 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:15,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1129771970, now seen corresponding path program 1 times [2021-03-25 14:30:15,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:15,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428161166] [2021-03-25 14:30:15,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:15,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:15,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:30:15,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:15,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:15,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:15,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:15,687 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-25 14:30:15,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428161166] [2021-03-25 14:30:15,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:15,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:30:15,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318637332] [2021-03-25 14:30:15,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:30:15,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:15,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:30:15,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:30:15,689 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 214 [2021-03-25 14:30:15,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 284 flow. Second operand has 4 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-25 14:30:15,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:15,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 214 [2021-03-25 14:30:15,690 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:15,759 INFO L129 PetriNetUnfolder]: 200/455 cut-off events. [2021-03-25 14:30:15,759 INFO L130 PetriNetUnfolder]: For 654/818 co-relation queries the response was YES. [2021-03-25 14:30:15,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 455 events. 200/455 cut-off events. For 654/818 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2672 event pairs, 12 based on Foata normal form. 39/468 useless extension candidates. Maximal degree in co-relation 1460. Up to 134 conditions per place. [2021-03-25 14:30:15,762 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 6 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2021-03-25 14:30:15,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 338 flow [2021-03-25 14:30:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:30:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:30:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions. [2021-03-25 14:30:15,764 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8621495327102804 [2021-03-25 14:30:15,764 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 738 transitions. [2021-03-25 14:30:15,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions. [2021-03-25 14:30:15,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:15,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions. [2021-03-25 14:30:15,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 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-25 14:30:15,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 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-25 14:30:15,768 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 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-25 14:30:15,768 INFO L185 Difference]: Start difference. First operand has 49 places, 48 transitions, 284 flow. Second operand 4 states and 738 transitions. [2021-03-25 14:30:15,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 338 flow [2021-03-25 14:30:15,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 330 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-25 14:30:15,773 INFO L241 Difference]: Finished difference. Result has 54 places, 52 transitions, 337 flow [2021-03-25 14:30:15,773 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2021-03-25 14:30:15,774 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-25 14:30:15,774 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:15,774 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 52 transitions, 337 flow [2021-03-25 14:30:15,774 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 337 flow [2021-03-25 14:30:15,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 337 flow [2021-03-25 14:30:15,800 INFO L129 PetriNetUnfolder]: 195/431 cut-off events. [2021-03-25 14:30:15,800 INFO L130 PetriNetUnfolder]: For 596/702 co-relation queries the response was YES. [2021-03-25 14:30:15,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 431 events. 195/431 cut-off events. For 596/702 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2480 event pairs, 13 based on Foata normal form. 17/420 useless extension candidates. Maximal degree in co-relation 1377. Up to 128 conditions per place. [2021-03-25 14:30:15,804 INFO L142 LiptonReduction]: Number of co-enabled transitions 534 [2021-03-25 14:30:16,367 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:30:16,616 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:30:17,738 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:30:18,204 WARN L205 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:30:18,749 WARN L205 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:30:19,013 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:30:20,080 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-25 14:30:20,568 WARN L205 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 14:30:20,655 INFO L154 LiptonReduction]: Checked pairs total: 582 [2021-03-25 14:30:20,655 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:30:20,655 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4881 [2021-03-25 14:30:20,655 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 343 flow [2021-03-25 14:30:20,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 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-25 14:30:20,656 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:20,656 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:30:20,656 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:30:20,656 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:20,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:20,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1409392586, now seen corresponding path program 2 times [2021-03-25 14:30:20,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:20,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216804316] [2021-03-25 14:30:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:20,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:20,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:30:20,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:20,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:20,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:20,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:20,693 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-25 14:30:20,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216804316] [2021-03-25 14:30:20,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:20,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:30:20,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987487974] [2021-03-25 14:30:20,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:30:20,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:20,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:30:20,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:30:20,695 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 216 [2021-03-25 14:30:20,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 343 flow. Second operand has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 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-25 14:30:20,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:20,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 216 [2021-03-25 14:30:20,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:20,748 INFO L129 PetriNetUnfolder]: 243/544 cut-off events. [2021-03-25 14:30:20,748 INFO L130 PetriNetUnfolder]: For 983/1181 co-relation queries the response was YES. [2021-03-25 14:30:20,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 544 events. 243/544 cut-off events. For 983/1181 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3383 event pairs, 14 based on Foata normal form. 29/538 useless extension candidates. Maximal degree in co-relation 1785. Up to 166 conditions per place. [2021-03-25 14:30:20,750 INFO L132 encePairwiseOnDemand]: 212/216 looper letters, 4 selfloop transitions, 1 changer transitions 14/52 dead transitions. [2021-03-25 14:30:20,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 359 flow [2021-03-25 14:30:20,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:30:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:30:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 748 transitions. [2021-03-25 14:30:20,752 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8657407407407407 [2021-03-25 14:30:20,752 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 748 transitions. [2021-03-25 14:30:20,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 748 transitions. [2021-03-25 14:30:20,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:20,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 748 transitions. [2021-03-25 14:30:20,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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-25 14:30:20,755 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-25 14:30:20,755 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-25 14:30:20,755 INFO L185 Difference]: Start difference. First operand has 54 places, 52 transitions, 343 flow. Second operand 4 states and 748 transitions. [2021-03-25 14:30:20,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 359 flow [2021-03-25 14:30:20,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 356 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:30:20,763 INFO L241 Difference]: Finished difference. Result has 57 places, 38 transitions, 217 flow [2021-03-25 14:30:20,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2021-03-25 14:30:20,763 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2021-03-25 14:30:20,763 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:20,764 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 38 transitions, 217 flow [2021-03-25 14:30:20,764 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 38 transitions, 217 flow [2021-03-25 14:30:20,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 38 transitions, 217 flow [2021-03-25 14:30:20,777 INFO L129 PetriNetUnfolder]: 89/214 cut-off events. [2021-03-25 14:30:20,777 INFO L130 PetriNetUnfolder]: For 344/387 co-relation queries the response was YES. [2021-03-25 14:30:20,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 214 events. 89/214 cut-off events. For 344/387 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1013 event pairs, 18 based on Foata normal form. 13/213 useless extension candidates. Maximal degree in co-relation 678. Up to 68 conditions per place. [2021-03-25 14:30:20,779 INFO L142 LiptonReduction]: Number of co-enabled transitions 314 [2021-03-25 14:30:20,781 INFO L154 LiptonReduction]: Checked pairs total: 84 [2021-03-25 14:30:20,781 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:30:20,781 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-25 14:30:20,782 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 217 flow [2021-03-25 14:30:20,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 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-25 14:30:20,782 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:20,782 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:30:20,782 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:30:20,782 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:20,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:20,783 INFO L82 PathProgramCache]: Analyzing trace with hash -36310050, now seen corresponding path program 3 times [2021-03-25 14:30:20,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:20,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320316798] [2021-03-25 14:30:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:30:20,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:20,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:30:20,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:20,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:20,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:30:20,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:30:20,822 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-25 14:30:20,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320316798] [2021-03-25 14:30:20,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:30:20,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:30:20,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561273197] [2021-03-25 14:30:20,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:30:20,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:30:20,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:30:20,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:30:20,824 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 216 [2021-03-25 14:30:20,824 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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-25 14:30:20,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:30:20,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 216 [2021-03-25 14:30:20,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:30:20,856 INFO L129 PetriNetUnfolder]: 141/334 cut-off events. [2021-03-25 14:30:20,856 INFO L130 PetriNetUnfolder]: For 744/813 co-relation queries the response was YES. [2021-03-25 14:30:20,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 334 events. 141/334 cut-off events. For 744/813 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1894 event pairs, 22 based on Foata normal form. 24/336 useless extension candidates. Maximal degree in co-relation 1065. Up to 108 conditions per place. [2021-03-25 14:30:20,857 INFO L132 encePairwiseOnDemand]: 213/216 looper letters, 3 selfloop transitions, 1 changer transitions 3/39 dead transitions. [2021-03-25 14:30:20,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 39 transitions, 235 flow [2021-03-25 14:30:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:30:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:30:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 742 transitions. [2021-03-25 14:30:20,859 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8587962962962963 [2021-03-25 14:30:20,859 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 742 transitions. [2021-03-25 14:30:20,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 742 transitions. [2021-03-25 14:30:20,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:30:20,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 742 transitions. [2021-03-25 14:30:20,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 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-25 14:30:20,862 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-25 14:30:20,862 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-25 14:30:20,862 INFO L185 Difference]: Start difference. First operand has 55 places, 38 transitions, 217 flow. Second operand 4 states and 742 transitions. [2021-03-25 14:30:20,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 39 transitions, 235 flow [2021-03-25 14:30:20,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 39 transitions, 229 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 14:30:20,866 INFO L241 Difference]: Finished difference. Result has 57 places, 36 transitions, 203 flow [2021-03-25 14:30:20,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2021-03-25 14:30:20,866 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2021-03-25 14:30:20,866 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:30:20,866 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 36 transitions, 203 flow [2021-03-25 14:30:20,866 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 36 transitions, 203 flow [2021-03-25 14:30:20,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 36 transitions, 203 flow [2021-03-25 14:30:20,877 INFO L129 PetriNetUnfolder]: 72/184 cut-off events. [2021-03-25 14:30:20,878 INFO L130 PetriNetUnfolder]: For 281/311 co-relation queries the response was YES. [2021-03-25 14:30:20,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 184 events. 72/184 cut-off events. For 281/311 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 877 event pairs, 11 based on Foata normal form. 11/183 useless extension candidates. Maximal degree in co-relation 577. Up to 60 conditions per place. [2021-03-25 14:30:20,879 INFO L142 LiptonReduction]: Number of co-enabled transitions 186 [2021-03-25 14:30:21,013 INFO L154 LiptonReduction]: Checked pairs total: 125 [2021-03-25 14:30:21,013 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:30:21,014 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 148 [2021-03-25 14:30:21,014 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 34 transitions, 199 flow [2021-03-25 14:30:21,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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-25 14:30:21,014 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:30:21,014 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-25 14:30:21,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:30:21,014 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:30:21,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:30:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1102639018, now seen corresponding path program 1 times [2021-03-25 14:30:21,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:30:21,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843535085] [2021-03-25 14:30:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:30:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:30:21,045 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:30:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:30:21,075 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:30:21,107 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:30:21,107 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:30:21,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:30:21,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:30:21 BasicIcfg [2021-03-25 14:30:21,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:30:21,190 INFO L168 Benchmark]: Toolchain (without parser) took 15085.91 ms. Allocated memory was 255.9 MB in the beginning and 635.4 MB in the end (delta: 379.6 MB). Free memory was 234.1 MB in the beginning and 345.3 MB in the end (delta: -111.2 MB). Peak memory consumption was 268.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:30:21,191 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:30:21,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.67 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 234.0 MB in the beginning and 325.9 MB in the end (delta: -92.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:30:21,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.71 ms. Allocated memory is still 367.0 MB. Free memory was 325.9 MB in the beginning and 323.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:30:21,191 INFO L168 Benchmark]: Boogie Preprocessor took 21.40 ms. Allocated memory is still 367.0 MB. Free memory was 323.4 MB in the beginning and 321.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:30:21,191 INFO L168 Benchmark]: RCFGBuilder took 1204.35 ms. Allocated memory is still 367.0 MB. Free memory was 321.3 MB in the beginning and 274.1 MB in the end (delta: 47.3 MB). Peak memory consumption was 50.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:30:21,191 INFO L168 Benchmark]: TraceAbstraction took 13494.95 ms. Allocated memory was 367.0 MB in the beginning and 635.4 MB in the end (delta: 268.4 MB). Free memory was 274.1 MB in the beginning and 345.3 MB in the end (delta: -71.3 MB). Peak memory consumption was 198.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:30:21,192 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.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 327.67 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 234.0 MB in the beginning and 325.9 MB in the end (delta: -92.0 MB). Peak memory consumption was 19.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 31.71 ms. Allocated memory is still 367.0 MB. Free memory was 325.9 MB in the beginning and 323.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 21.40 ms. Allocated memory is still 367.0 MB. Free memory was 323.4 MB in the beginning and 321.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1204.35 ms. Allocated memory is still 367.0 MB. Free memory was 321.3 MB in the beginning and 274.1 MB in the end (delta: 47.3 MB). Peak memory consumption was 50.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 13494.95 ms. Allocated memory was 367.0 MB in the beginning and 635.4 MB in the end (delta: 268.4 MB). Free memory was 274.1 MB in the beginning and 345.3 MB in the end (delta: -71.3 MB). Peak memory consumption was 198.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2676.3ms, 125 PlacesBefore, 58 PlacesAfterwards, 114 TransitionsBefore, 46 TransitionsAfterwards, 2488 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 3568 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2330, positive: 2250, positive conditional: 0, positive unconditional: 2250, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1584, positive: 1555, positive conditional: 0, positive unconditional: 1555, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1584, positive: 1555, positive conditional: 0, positive unconditional: 1555, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1584, positive: 1545, positive conditional: 0, positive unconditional: 1545, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 278, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 250, negative conditional: 0, negative unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2330, positive: 695, positive conditional: 0, positive unconditional: 695, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 1584, unknown conditional: 0, unknown unconditional: 1584] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1712.7ms, 54 PlacesBefore, 38 PlacesAfterwards, 43 TransitionsBefore, 27 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 16 TotalNumberOfCompositions, 2256 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 936, positive: 807, positive conditional: 0, positive unconditional: 807, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 122, positive: 100, positive conditional: 0, positive unconditional: 100, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 122, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 152, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 126, negative conditional: 0, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 936, positive: 707, positive conditional: 0, positive unconditional: 707, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 122, unknown conditional: 0, unknown unconditional: 122] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 188, Positive conditional cache size: 0, Positive unconditional cache size: 188, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 941.1ms, 42 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 324 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 113, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 6, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 33, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 113, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 193, Positive conditional cache size: 0, Positive unconditional cache size: 193, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.5ms, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 74, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 195, Positive conditional cache size: 0, Positive unconditional cache size: 195, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 69.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 366 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 104, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.5ms, 49 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 410 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 108, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 367 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 104, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 739.9ms, 55 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 39 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 398 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 133, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 133, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 152, Positive conditional cache size: 0, Positive unconditional cache size: 152, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.8ms, 49 PlacesBefore, 49 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 263 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 68, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 154, Positive conditional cache size: 0, Positive unconditional cache size: 154, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4880.9ms, 54 PlacesBefore, 54 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 582 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 272, positive: 250, positive conditional: 0, positive unconditional: 250, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 71, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 272, positive: 249, positive conditional: 0, positive unconditional: 249, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 162, Positive conditional cache size: 0, Positive unconditional cache size: 162, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.5ms, 57 PlacesBefore, 55 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 84 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 56, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 147.0ms, 57 PlacesBefore, 54 PlacesAfterwards, 36 TransitionsBefore, 34 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 125 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 83, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - 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_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L858] 0 pthread_t t965; [L859] FCALL, FORK 0 pthread_create(&t965, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t966; [L861] FCALL, FORK 0 pthread_create(&t966, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t967; [L863] FCALL, FORK 0 pthread_create(&t967, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 pthread_t t968; [L865] FCALL, FORK 0 pthread_create(&t968, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff1 = z$w_buff0 [L815] 4 z$w_buff0 = 1 [L816] 4 z$w_buff1_used = z$w_buff0_used [L817] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L819] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L820] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L821] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L822] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L823] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L786] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 3 z$flush_delayed = weak$$choice2 [L792] 3 z$mem_tmp = z [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L794] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L795] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L796] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L797] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L798] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L799] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 __unbuffered_p2_EAX = z [L801] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L801] 3 z = z$flush_delayed ? z$mem_tmp : z [L802] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L836] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L837] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L837] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L838] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L839] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L839] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L840] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L840] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L871] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L871] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L872] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L872] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L873] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L874] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L874] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L875] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L875] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_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_p1_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, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13304.3ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 867.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2759.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 59 SDtfs, 40 SDslu, 33 SDs, 0 SdLazy, 212 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 148.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 114.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=9, InterpolantAutomatonStates: 54, 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: 30.9ms SsaConstructionTime, 346.3ms SatisfiabilityAnalysisTime, 434.8ms InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...