/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-28 20:11:39,368 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-28 20:11:39,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-28 20:11:39,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-28 20:11:39,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-28 20:11:39,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-28 20:11:39,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-28 20:11:39,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-28 20:11:39,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-28 20:11:39,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-28 20:11:39,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-28 20:11:39,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-28 20:11:39,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-28 20:11:39,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-28 20:11:39,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-28 20:11:39,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-28 20:11:39,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-28 20:11:39,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-28 20:11:39,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-28 20:11:39,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-28 20:11:39,491 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-28 20:11:39,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-28 20:11:39,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-28 20:11:39,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-28 20:11:39,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-28 20:11:39,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-28 20:11:39,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-28 20:11:39,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-28 20:11:39,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-28 20:11:39,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-28 20:11:39,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-28 20:11:39,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-28 20:11:39,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-28 20:11:39,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-28 20:11:39,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-28 20:11:39,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-28 20:11:39,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-28 20:11:39,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-28 20:11:39,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-28 20:11:39,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-28 20:11:39,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-28 20:11:39,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-04-28 20:11:39,578 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-28 20:11:39,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-28 20:11:39,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-28 20:11:39,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-28 20:11:39,580 INFO L138 SettingsManager]: * Use SBE=true [2021-04-28 20:11:39,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-28 20:11:39,581 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-28 20:11:39,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-28 20:11:39,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-28 20:11:39,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-28 20:11:39,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-28 20:11:39,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-28 20:11:39,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-28 20:11:39,583 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-28 20:11:39,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-28 20:11:39,583 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-28 20:11:39,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-28 20:11:39,583 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-28 20:11:39,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-28 20:11:39,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-28 20:11:39,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-28 20:11:39,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-28 20:11:39,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-28 20:11:39,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-28 20:11:39,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-28 20:11:39,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-28 20:11:39,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-28 20:11:39,586 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-28 20:11:39,586 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-28 20:11:39,586 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-28 20:11:39,586 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-04-28 20:11:39,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-28 20:11:39,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-28 20:11:39,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-28 20:11:39,994 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-28 20:11:39,997 INFO L275 PluginConnector]: CDTParser initialized [2021-04-28 20:11:39,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2021-04-28 20:11:40,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94c04119/06936d2a899a46aba50b2b20f46390bd/FLAGb59f4cee6 [2021-04-28 20:11:40,857 INFO L306 CDTParser]: Found 1 translation units. [2021-04-28 20:11:40,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt.i [2021-04-28 20:11:40,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94c04119/06936d2a899a46aba50b2b20f46390bd/FLAGb59f4cee6 [2021-04-28 20:11:41,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b94c04119/06936d2a899a46aba50b2b20f46390bd [2021-04-28 20:11:41,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-28 20:11:41,167 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-28 20:11:41,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-28 20:11:41,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-28 20:11:41,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-28 20:11:41,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:11:41" (1/1) ... [2021-04-28 20:11:41,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25659a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:41, skipping insertion in model container [2021-04-28 20:11:41,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:11:41" (1/1) ... [2021-04-28 20:11:41,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-28 20:11:41,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-28 20:11:41,449 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/mix035_power.opt.i[993,1006] [2021-04-28 20:11:41,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-28 20:11:41,738 INFO L203 MainTranslator]: Completed pre-run [2021-04-28 20:11:41,758 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/mix035_power.opt.i[993,1006] [2021-04-28 20:11:41,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-28 20:11:42,018 INFO L208 MainTranslator]: Completed translation [2021-04-28 20:11:42,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42 WrapperNode [2021-04-28 20:11:42,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-28 20:11:42,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-28 20:11:42,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-28 20:11:42,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-28 20:11:42,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (1/1) ... [2021-04-28 20:11:42,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (1/1) ... [2021-04-28 20:11:42,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-28 20:11:42,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-28 20:11:42,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-28 20:11:42,086 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-28 20:11:42,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (1/1) ... [2021-04-28 20:11:42,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (1/1) ... [2021-04-28 20:11:42,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (1/1) ... [2021-04-28 20:11:42,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (1/1) ... [2021-04-28 20:11:42,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (1/1) ... [2021-04-28 20:11:42,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (1/1) ... [2021-04-28 20:11:42,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (1/1) ... [2021-04-28 20:11:42,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-28 20:11:42,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-28 20:11:42,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-28 20:11:42,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-28 20:11:42,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (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-04-28 20:11:42,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-28 20:11:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-28 20:11:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-28 20:11:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-28 20:11:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-28 20:11:42,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-28 20:11:42,296 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-28 20:11:42,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-28 20:11:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-28 20:11:42,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-28 20:11:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-28 20:11:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-28 20:11:42,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-28 20:11:42,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-28 20:11:42,299 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-28 20:11:44,454 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-28 20:11:44,455 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-28 20:11:44,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:11:44 BoogieIcfgContainer [2021-04-28 20:11:44,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-28 20:11:44,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-28 20:11:44,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-28 20:11:44,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-28 20:11:44,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:11:41" (1/3) ... [2021-04-28 20:11:44,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8c27df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:11:44, skipping insertion in model container [2021-04-28 20:11:44,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:11:42" (2/3) ... [2021-04-28 20:11:44,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a8c27df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:11:44, skipping insertion in model container [2021-04-28 20:11:44,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:11:44" (3/3) ... [2021-04-28 20:11:44,467 INFO L111 eAbstractionObserver]: Analyzing ICFG mix035_power.opt.i [2021-04-28 20:11:44,475 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-28 20:11:44,480 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-28 20:11:44,481 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-28 20:11:44,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,520 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,547 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,548 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,548 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,548 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,556 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,558 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,562 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,563 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,564 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,564 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,567 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,567 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-28 20:11:44,570 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-28 20:11:44,593 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-28 20:11:44,619 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-28 20:11:44,619 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-28 20:11:44,620 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-28 20:11:44,620 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-28 20:11:44,620 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-28 20:11:44,620 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-28 20:11:44,620 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-28 20:11:44,620 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-28 20:11:44,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 219 flow [2021-04-28 20:11:44,684 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-04-28 20:11:44,684 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:11:44,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-04-28 20:11:44,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 102 transitions, 219 flow [2021-04-28 20:11:44,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 99 transitions, 207 flow [2021-04-28 20:11:44,698 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:11:44,715 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 207 flow [2021-04-28 20:11:44,719 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 207 flow [2021-04-28 20:11:44,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 207 flow [2021-04-28 20:11:44,749 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-04-28 20:11:44,749 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:11:44,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-04-28 20:11:44,754 INFO L146 LiptonReduction]: Number of co-enabled transitions 1750 [2021-04-28 20:11:46,982 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-28 20:11:47,084 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-28 20:11:47,557 WARN L205 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-04-28 20:11:47,728 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-28 20:11:49,148 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-28 20:11:49,296 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-28 20:11:56,605 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-28 20:11:56,712 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-28 20:11:56,822 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-28 20:11:56,972 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-28 20:11:59,533 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-04-28 20:11:59,642 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-04-28 20:11:59,755 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-04-28 20:11:59,869 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-04-28 20:12:02,973 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-28 20:12:05,139 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 20:12:05,381 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-28 20:12:05,910 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 20:12:06,077 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 20:12:06,238 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 20:12:06,385 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-28 20:12:06,514 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 20:12:06,640 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 20:12:06,777 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 20:12:06,912 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-28 20:12:07,016 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 20:12:07,124 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 20:12:07,230 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 20:12:07,338 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-28 20:12:07,497 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:07,652 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:07,805 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:07,959 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:08,151 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:08,311 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:08,473 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:08,636 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:08,786 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 20:12:08,947 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 20:12:09,103 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 20:12:09,256 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-04-28 20:12:09,388 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 20:12:09,511 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 20:12:09,639 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 20:12:09,769 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-28 20:12:09,923 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 20:12:10,069 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 20:12:10,223 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 20:12:10,372 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-04-28 20:12:10,487 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 20:12:10,601 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 20:12:10,711 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 20:12:10,859 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-28 20:12:10,980 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:12:11,094 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:12:11,218 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:12:11,338 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:12:11,474 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 20:12:11,611 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 20:12:11,743 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 20:12:11,880 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-28 20:12:12,044 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:12,201 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:12,365 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:12,516 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:12,652 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 20:12:12,784 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 20:12:12,914 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 20:12:13,050 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-28 20:12:13,169 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:12:13,290 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:12:13,435 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:12:13,553 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-28 20:12:13,958 WARN L205 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-04-28 20:12:14,151 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-04-28 20:12:14,558 WARN L205 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-04-28 20:12:14,759 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-04-28 20:12:14,906 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:15,063 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:15,220 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:15,375 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:15,533 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:15,689 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:15,845 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:16,041 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-04-28 20:12:16,465 WARN L205 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2021-04-28 20:12:16,672 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-04-28 20:12:17,089 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 115 [2021-04-28 20:12:17,275 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-04-28 20:12:17,385 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 20:12:17,493 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 20:12:17,602 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 20:12:17,704 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-28 20:12:17,763 INFO L158 LiptonReduction]: Checked pairs total: 16010 [2021-04-28 20:12:17,763 INFO L160 LiptonReduction]: Total number of compositions: 259 [2021-04-28 20:12:17,769 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33073 [2021-04-28 20:12:17,792 INFO L129 PetriNetUnfolder]: 0/64 cut-off events. [2021-04-28 20:12:17,792 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:12:17,792 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:12:17,793 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-04-28 20:12:17,794 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 20:12:17,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:12:17,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1100023201, now seen corresponding path program 1 times [2021-04-28 20:12:17,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:12:17,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256107512] [2021-04-28 20:12:17,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:12:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:12:18,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:18,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 20:12:18,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256107512] [2021-04-28 20:12:18,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:12:18,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 20:12:18,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15828827] [2021-04-28 20:12:18,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 20:12:18,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:12:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 20:12:18,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 20:12:18,144 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 361 [2021-04-28 20:12:18,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 126 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 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-04-28 20:12:18,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:12:18,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 361 [2021-04-28 20:12:18,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:12:18,299 INFO L129 PetriNetUnfolder]: 29/389 cut-off events. [2021-04-28 20:12:18,300 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:12:18,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 389 events. 29/389 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3008 event pairs, 15 based on Foata normal form. 23/101 useless extension candidates. Maximal degree in co-relation 392. Up to 41 conditions per place. [2021-04-28 20:12:18,306 INFO L132 encePairwiseOnDemand]: 343/361 looper letters, 7 selfloop transitions, 2 changer transitions 53/125 dead transitions. [2021-04-28 20:12:18,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 125 transitions, 301 flow [2021-04-28 20:12:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 20:12:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 20:12:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2021-04-28 20:12:18,326 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8180978762696214 [2021-04-28 20:12:18,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 886 transitions. [2021-04-28 20:12:18,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 886 transitions. [2021-04-28 20:12:18,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:12:18,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 886 transitions. [2021-04-28 20:12:18,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-04-28 20:12:18,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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-04-28 20:12:18,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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-04-28 20:12:18,365 INFO L185 Difference]: Start difference. First operand has 135 places, 126 transitions, 261 flow. Second operand 3 states and 886 transitions. [2021-04-28 20:12:18,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 125 transitions, 301 flow [2021-04-28 20:12:18,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 125 transitions, 298 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-28 20:12:18,377 INFO L241 Difference]: Finished difference. Result has 131 places, 69 transitions, 148 flow [2021-04-28 20:12:18,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=131, PETRI_TRANSITIONS=69} [2021-04-28 20:12:18,380 INFO L343 CegarLoopForPetriNet]: 135 programPoint places, -4 predicate places. [2021-04-28 20:12:18,380 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:12:18,380 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 69 transitions, 148 flow [2021-04-28 20:12:18,381 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 69 transitions, 148 flow [2021-04-28 20:12:18,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 69 transitions, 148 flow [2021-04-28 20:12:18,392 INFO L129 PetriNetUnfolder]: 0/69 cut-off events. [2021-04-28 20:12:18,392 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:12:18,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 0/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 332 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-28 20:12:18,394 INFO L146 LiptonReduction]: Number of co-enabled transitions 2220 [2021-04-28 20:12:18,649 INFO L158 LiptonReduction]: Checked pairs total: 2714 [2021-04-28 20:12:18,649 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:12:18,649 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 269 [2021-04-28 20:12:18,651 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 148 flow [2021-04-28 20:12:18,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 286.6666666666667) internal successors, (860), 3 states have internal predecessors, (860), 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-04-28 20:12:18,653 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:12:18,653 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:12:18,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-28 20:12:18,653 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 20:12:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:12:18,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1670024836, now seen corresponding path program 1 times [2021-04-28 20:12:18,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:12:18,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028536001] [2021-04-28 20:12:18,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:12:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:12:18,808 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 20:12:18,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 20:12:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 20:12:18,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028536001] [2021-04-28 20:12:18,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:12:18,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 20:12:18,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081858577] [2021-04-28 20:12:18,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 20:12:18,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:12:18,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 20:12:18,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 20:12:18,825 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 361 [2021-04-28 20:12:18,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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-04-28 20:12:18,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:12:18,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 361 [2021-04-28 20:12:18,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:12:19,223 INFO L129 PetriNetUnfolder]: 546/1629 cut-off events. [2021-04-28 20:12:19,223 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:12:19,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2604 conditions, 1629 events. 546/1629 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 15727 event pairs, 179 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 2595. Up to 822 conditions per place. [2021-04-28 20:12:19,232 INFO L132 encePairwiseOnDemand]: 342/361 looper letters, 5 selfloop transitions, 4 changer transitions 45/94 dead transitions. [2021-04-28 20:12:19,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 306 flow [2021-04-28 20:12:19,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 20:12:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 20:12:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2021-04-28 20:12:19,236 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6777469990766389 [2021-04-28 20:12:19,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 734 transitions. [2021-04-28 20:12:19,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 734 transitions. [2021-04-28 20:12:19,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:12:19,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 734 transitions. [2021-04-28 20:12:19,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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-04-28 20:12:19,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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-04-28 20:12:19,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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-04-28 20:12:19,245 INFO L185 Difference]: Start difference. First operand has 78 places, 69 transitions, 148 flow. Second operand 3 states and 734 transitions. [2021-04-28 20:12:19,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 306 flow [2021-04-28 20:12:19,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 94 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 20:12:19,248 INFO L241 Difference]: Finished difference. Result has 79 places, 49 transitions, 126 flow [2021-04-28 20:12:19,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=79, PETRI_TRANSITIONS=49} [2021-04-28 20:12:19,250 INFO L343 CegarLoopForPetriNet]: 135 programPoint places, -56 predicate places. [2021-04-28 20:12:19,250 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:12:19,250 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 49 transitions, 126 flow [2021-04-28 20:12:19,250 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 49 transitions, 126 flow [2021-04-28 20:12:19,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 126 flow [2021-04-28 20:12:19,272 INFO L129 PetriNetUnfolder]: 26/129 cut-off events. [2021-04-28 20:12:19,273 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-28 20:12:19,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 129 events. 26/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 592 event pairs, 12 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 182. Up to 49 conditions per place. [2021-04-28 20:12:19,277 INFO L146 LiptonReduction]: Number of co-enabled transitions 1276 [2021-04-28 20:12:19,398 INFO L158 LiptonReduction]: Checked pairs total: 670 [2021-04-28 20:12:19,398 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:12:19,398 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 148 [2021-04-28 20:12:19,402 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 126 flow [2021-04-28 20:12:19,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 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-04-28 20:12:19,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:12:19,403 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:12:19,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-28 20:12:19,403 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 20:12:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:12:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1423991176, now seen corresponding path program 1 times [2021-04-28 20:12:19,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:12:19,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314228216] [2021-04-28 20:12:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:12:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:12:19,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:19,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 20:12:19,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314228216] [2021-04-28 20:12:19,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:12:19,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-28 20:12:19,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80959177] [2021-04-28 20:12:19,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-28 20:12:19,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:12:19,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-28 20:12:19,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-28 20:12:19,607 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 361 [2021-04-28 20:12:19,608 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-04-28 20:12:19,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:12:19,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 361 [2021-04-28 20:12:19,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:12:19,634 INFO L129 PetriNetUnfolder]: 21/101 cut-off events. [2021-04-28 20:12:19,634 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-04-28 20:12:19,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 101 events. 21/101 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 439 event pairs, 8 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 158. Up to 41 conditions per place. [2021-04-28 20:12:19,636 INFO L132 encePairwiseOnDemand]: 358/361 looper letters, 1 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2021-04-28 20:12:19,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 134 flow [2021-04-28 20:12:19,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-28 20:12:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-28 20:12:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2021-04-28 20:12:19,639 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6823638042474608 [2021-04-28 20:12:19,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 739 transitions. [2021-04-28 20:12:19,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 739 transitions. [2021-04-28 20:12:19,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:12:19,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 739 transitions. [2021-04-28 20:12:19,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 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-04-28 20:12:19,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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-04-28 20:12:19,647 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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-04-28 20:12:19,648 INFO L185 Difference]: Start difference. First operand has 56 places, 49 transitions, 126 flow. Second operand 3 states and 739 transitions. [2021-04-28 20:12:19,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 134 flow [2021-04-28 20:12:19,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-28 20:12:19,652 INFO L241 Difference]: Finished difference. Result has 58 places, 49 transitions, 133 flow [2021-04-28 20:12:19,654 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2021-04-28 20:12:19,654 INFO L343 CegarLoopForPetriNet]: 135 programPoint places, -77 predicate places. [2021-04-28 20:12:19,654 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:12:19,655 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 49 transitions, 133 flow [2021-04-28 20:12:19,656 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 49 transitions, 133 flow [2021-04-28 20:12:19,656 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 133 flow [2021-04-28 20:12:19,673 INFO L129 PetriNetUnfolder]: 21/105 cut-off events. [2021-04-28 20:12:19,673 INFO L130 PetriNetUnfolder]: For 11/14 co-relation queries the response was YES. [2021-04-28 20:12:19,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 105 events. 21/105 cut-off events. For 11/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 468 event pairs, 11 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 163. Up to 41 conditions per place. [2021-04-28 20:12:19,676 INFO L146 LiptonReduction]: Number of co-enabled transitions 1268 [2021-04-28 20:12:19,681 INFO L158 LiptonReduction]: Checked pairs total: 668 [2021-04-28 20:12:19,681 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:12:19,681 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-04-28 20:12:19,683 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 133 flow [2021-04-28 20:12:19,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-04-28 20:12:19,684 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:12:19,684 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:12:19,684 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-28 20:12:19,685 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 20:12:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:12:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1423988479, now seen corresponding path program 1 times [2021-04-28 20:12:19,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:12:19,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740621872] [2021-04-28 20:12:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:12:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:12:19,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:19,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:19,792 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-28 20:12:19,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-28 20:12:19,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:19,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 20:12:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 20:12:19,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740621872] [2021-04-28 20:12:19,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:12:19,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 20:12:19,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47781407] [2021-04-28 20:12:19,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 20:12:19,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:12:19,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 20:12:19,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-28 20:12:19,805 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 361 [2021-04-28 20:12:19,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 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-04-28 20:12:19,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:12:19,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 361 [2021-04-28 20:12:19,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:12:20,533 INFO L129 PetriNetUnfolder]: 3711/6304 cut-off events. [2021-04-28 20:12:20,533 INFO L130 PetriNetUnfolder]: For 112/121 co-relation queries the response was YES. [2021-04-28 20:12:20,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12699 conditions, 6304 events. 3711/6304 cut-off events. For 112/121 co-relation queries the response was YES. Maximal size of possible extension queue 1296. Compared 53697 event pairs, 1643 based on Foata normal form. 106/1743 useless extension candidates. Maximal degree in co-relation 12687. Up to 3838 conditions per place. [2021-04-28 20:12:20,589 INFO L132 encePairwiseOnDemand]: 342/361 looper letters, 31 selfloop transitions, 30 changer transitions 0/87 dead transitions. [2021-04-28 20:12:20,589 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 331 flow [2021-04-28 20:12:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-28 20:12:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-28 20:12:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1373 transitions. [2021-04-28 20:12:20,595 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7606648199445983 [2021-04-28 20:12:20,595 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1373 transitions. [2021-04-28 20:12:20,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1373 transitions. [2021-04-28 20:12:20,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:12:20,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1373 transitions. [2021-04-28 20:12:20,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 274.6) internal successors, (1373), 5 states have internal predecessors, (1373), 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-04-28 20:12:20,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 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-04-28 20:12:20,609 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 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-04-28 20:12:20,609 INFO L185 Difference]: Start difference. First operand has 58 places, 49 transitions, 133 flow. Second operand 5 states and 1373 transitions. [2021-04-28 20:12:20,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 331 flow [2021-04-28 20:12:20,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-28 20:12:20,614 INFO L241 Difference]: Finished difference. Result has 63 places, 77 transitions, 352 flow [2021-04-28 20:12:20,614 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2021-04-28 20:12:20,615 INFO L343 CegarLoopForPetriNet]: 135 programPoint places, -72 predicate places. [2021-04-28 20:12:20,615 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:12:20,615 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 77 transitions, 352 flow [2021-04-28 20:12:20,615 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 77 transitions, 352 flow [2021-04-28 20:12:20,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 77 transitions, 352 flow [2021-04-28 20:12:21,167 INFO L129 PetriNetUnfolder]: 3320/5854 cut-off events. [2021-04-28 20:12:21,167 INFO L130 PetriNetUnfolder]: For 1331/9918 co-relation queries the response was YES. [2021-04-28 20:12:21,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16321 conditions, 5854 events. 3320/5854 cut-off events. For 1331/9918 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 52779 event pairs, 1537 based on Foata normal form. 3/1505 useless extension candidates. Maximal degree in co-relation 16308. Up to 5267 conditions per place. [2021-04-28 20:12:21,263 INFO L146 LiptonReduction]: Number of co-enabled transitions 1704 [2021-04-28 20:12:21,506 INFO L158 LiptonReduction]: Checked pairs total: 1307 [2021-04-28 20:12:21,506 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:12:21,506 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 891 [2021-04-28 20:12:21,508 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 352 flow [2021-04-28 20:12:21,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 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-04-28 20:12:21,509 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:12:21,510 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:12:21,510 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-28 20:12:21,510 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 20:12:21,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:12:21,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1618916520, now seen corresponding path program 1 times [2021-04-28 20:12:21,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:12:21,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356852550] [2021-04-28 20:12:21,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:12:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:12:21,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:21,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:21,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:21,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:21,600 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-28 20:12:21,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-28 20:12:21,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:21,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 20:12:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 20:12:21,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356852550] [2021-04-28 20:12:21,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:12:21,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-28 20:12:21,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129501871] [2021-04-28 20:12:21,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 20:12:21,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:12:21,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 20:12:21,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-28 20:12:21,616 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 361 [2021-04-28 20:12:21,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 263.8) internal successors, (1319), 5 states have internal predecessors, (1319), 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-04-28 20:12:21,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:12:21,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 361 [2021-04-28 20:12:21,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:12:22,594 INFO L129 PetriNetUnfolder]: 3405/6637 cut-off events. [2021-04-28 20:12:22,594 INFO L130 PetriNetUnfolder]: For 2391/25551 co-relation queries the response was YES. [2021-04-28 20:12:22,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24979 conditions, 6637 events. 3405/6637 cut-off events. For 2391/25551 co-relation queries the response was YES. Maximal size of possible extension queue 1644. Compared 62602 event pairs, 317 based on Foata normal form. 150/2075 useless extension candidates. Maximal degree in co-relation 24964. Up to 5972 conditions per place. [2021-04-28 20:12:22,656 INFO L132 encePairwiseOnDemand]: 342/361 looper letters, 23 selfloop transitions, 58 changer transitions 9/116 dead transitions. [2021-04-28 20:12:22,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 116 transitions, 739 flow [2021-04-28 20:12:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-28 20:12:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-28 20:12:22,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1925 transitions. [2021-04-28 20:12:22,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7617728531855956 [2021-04-28 20:12:22,663 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1925 transitions. [2021-04-28 20:12:22,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1925 transitions. [2021-04-28 20:12:22,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:12:22,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1925 transitions. [2021-04-28 20:12:22,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 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-04-28 20:12:22,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 361.0) internal successors, (2888), 8 states have internal predecessors, (2888), 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-04-28 20:12:22,680 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 361.0) internal successors, (2888), 8 states have internal predecessors, (2888), 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-04-28 20:12:22,680 INFO L185 Difference]: Start difference. First operand has 63 places, 77 transitions, 352 flow. Second operand 7 states and 1925 transitions. [2021-04-28 20:12:22,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 116 transitions, 739 flow [2021-04-28 20:12:22,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 116 transitions, 739 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-04-28 20:12:22,725 INFO L241 Difference]: Finished difference. Result has 72 places, 105 transitions, 725 flow [2021-04-28 20:12:22,725 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=725, PETRI_PLACES=72, PETRI_TRANSITIONS=105} [2021-04-28 20:12:22,725 INFO L343 CegarLoopForPetriNet]: 135 programPoint places, -63 predicate places. [2021-04-28 20:12:22,725 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:12:22,726 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 105 transitions, 725 flow [2021-04-28 20:12:22,726 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 105 transitions, 725 flow [2021-04-28 20:12:22,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 105 transitions, 725 flow [2021-04-28 20:12:23,370 INFO L129 PetriNetUnfolder]: 2166/4807 cut-off events. [2021-04-28 20:12:23,371 INFO L130 PetriNetUnfolder]: For 27789/49115 co-relation queries the response was YES. [2021-04-28 20:12:23,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20325 conditions, 4807 events. 2166/4807 cut-off events. For 27789/49115 co-relation queries the response was YES. Maximal size of possible extension queue 1283. Compared 51255 event pairs, 330 based on Foata normal form. 1/1255 useless extension candidates. Maximal degree in co-relation 20307. Up to 4220 conditions per place. [2021-04-28 20:12:23,464 INFO L146 LiptonReduction]: Number of co-enabled transitions 2170 [2021-04-28 20:12:24,130 INFO L158 LiptonReduction]: Checked pairs total: 2525 [2021-04-28 20:12:24,130 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-28 20:12:24,130 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1405 [2021-04-28 20:12:24,132 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 105 transitions, 725 flow [2021-04-28 20:12:24,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 263.8) internal successors, (1319), 5 states have internal predecessors, (1319), 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-04-28 20:12:24,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:12:24,133 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:12:24,133 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-28 20:12:24,134 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 20:12:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:12:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash -793073587, now seen corresponding path program 1 times [2021-04-28 20:12:24,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:12:24,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637427437] [2021-04-28 20:12:24,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:12:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:12:24,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:24,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 20:12:24,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:24,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:24,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:24,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 20:12:24,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637427437] [2021-04-28 20:12:24,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:12:24,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-28 20:12:24,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437695718] [2021-04-28 20:12:24,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-28 20:12:24,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:12:24,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-28 20:12:24,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-28 20:12:24,217 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 361 [2021-04-28 20:12:24,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 105 transitions, 725 flow. Second operand has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-04-28 20:12:24,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:12:24,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 361 [2021-04-28 20:12:24,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:12:25,320 INFO L129 PetriNetUnfolder]: 3854/8255 cut-off events. [2021-04-28 20:12:25,320 INFO L130 PetriNetUnfolder]: For 37522/63358 co-relation queries the response was YES. [2021-04-28 20:12:25,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34986 conditions, 8255 events. 3854/8255 cut-off events. For 37522/63358 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 89827 event pairs, 605 based on Foata normal form. 46/2248 useless extension candidates. Maximal degree in co-relation 34966. Up to 7409 conditions per place. [2021-04-28 20:12:25,409 INFO L132 encePairwiseOnDemand]: 358/361 looper letters, 4 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2021-04-28 20:12:25,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 107 transitions, 747 flow [2021-04-28 20:12:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-28 20:12:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-28 20:12:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 971 transitions. [2021-04-28 20:12:25,416 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6724376731301939 [2021-04-28 20:12:25,416 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 971 transitions. [2021-04-28 20:12:25,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 971 transitions. [2021-04-28 20:12:25,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:12:25,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 971 transitions. [2021-04-28 20:12:25,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 242.75) internal successors, (971), 4 states have internal predecessors, (971), 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-04-28 20:12:25,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 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-04-28 20:12:25,425 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 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-04-28 20:12:25,425 INFO L185 Difference]: Start difference. First operand has 72 places, 105 transitions, 725 flow. Second operand 4 states and 971 transitions. [2021-04-28 20:12:25,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 107 transitions, 747 flow [2021-04-28 20:12:27,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 107 transitions, 606 flow, removed 45 selfloop flow, removed 3 redundant places. [2021-04-28 20:12:27,075 INFO L241 Difference]: Finished difference. Result has 74 places, 106 transitions, 599 flow [2021-04-28 20:12:27,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=599, PETRI_PLACES=74, PETRI_TRANSITIONS=106} [2021-04-28 20:12:27,075 INFO L343 CegarLoopForPetriNet]: 135 programPoint places, -61 predicate places. [2021-04-28 20:12:27,075 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:12:27,076 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 106 transitions, 599 flow [2021-04-28 20:12:27,076 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 106 transitions, 599 flow [2021-04-28 20:12:27,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 106 transitions, 599 flow [2021-04-28 20:12:27,886 INFO L129 PetriNetUnfolder]: 3872/8264 cut-off events. [2021-04-28 20:12:27,886 INFO L130 PetriNetUnfolder]: For 5347/5817 co-relation queries the response was YES. [2021-04-28 20:12:27,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27482 conditions, 8264 events. 3872/8264 cut-off events. For 5347/5817 co-relation queries the response was YES. Maximal size of possible extension queue 2069. Compared 93402 event pairs, 612 based on Foata normal form. 1/2172 useless extension candidates. Maximal degree in co-relation 27463. Up to 3565 conditions per place. [2021-04-28 20:12:28,029 INFO L146 LiptonReduction]: Number of co-enabled transitions 2230 [2021-04-28 20:12:31,419 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-04-28 20:12:31,867 WARN L205 SmtUtils]: Spent 445.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-04-28 20:12:33,994 WARN L205 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-04-28 20:12:34,935 WARN L205 SmtUtils]: Spent 936.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-04-28 20:12:36,430 INFO L158 LiptonReduction]: Checked pairs total: 4913 [2021-04-28 20:12:36,431 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-28 20:12:36,431 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9356 [2021-04-28 20:12:36,434 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 107 transitions, 607 flow [2021-04-28 20:12:36,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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-04-28 20:12:36,435 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:12:36,435 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:12:36,436 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-28 20:12:36,436 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 20:12:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:12:36,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1030081798, now seen corresponding path program 1 times [2021-04-28 20:12:36,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:12:36,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104192295] [2021-04-28 20:12:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:12:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:12:36,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:36,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:36,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:36,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:36,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:36,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:36,626 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-28 20:12:36,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-28 20:12:36,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:36,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 20:12:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 20:12:36,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104192295] [2021-04-28 20:12:36,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:12:36,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-28 20:12:36,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779295032] [2021-04-28 20:12:36,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-28 20:12:36,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:12:36,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-28 20:12:36,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-28 20:12:36,644 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 362 [2021-04-28 20:12:36,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 107 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 264.8333333333333) internal successors, (1589), 6 states have internal predecessors, (1589), 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-04-28 20:12:36,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:12:36,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 362 [2021-04-28 20:12:36,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:12:38,278 INFO L129 PetriNetUnfolder]: 3615/8797 cut-off events. [2021-04-28 20:12:38,279 INFO L130 PetriNetUnfolder]: For 7011/46911 co-relation queries the response was YES. [2021-04-28 20:12:38,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37039 conditions, 8797 events. 3615/8797 cut-off events. For 7011/46911 co-relation queries the response was YES. Maximal size of possible extension queue 2274. Compared 105434 event pairs, 2 based on Foata normal form. 256/2563 useless extension candidates. Maximal degree in co-relation 37018. Up to 4752 conditions per place. [2021-04-28 20:12:38,355 INFO L132 encePairwiseOnDemand]: 343/362 looper letters, 5 selfloop transitions, 70 changer transitions 33/129 dead transitions. [2021-04-28 20:12:38,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 129 transitions, 948 flow [2021-04-28 20:12:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-28 20:12:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-28 20:12:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2468 transitions. [2021-04-28 20:12:38,364 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7575199508901166 [2021-04-28 20:12:38,364 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2468 transitions. [2021-04-28 20:12:38,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2468 transitions. [2021-04-28 20:12:38,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:12:38,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2468 transitions. [2021-04-28 20:12:38,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 274.22222222222223) internal successors, (2468), 9 states have internal predecessors, (2468), 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-04-28 20:12:38,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 362.0) internal successors, (3620), 10 states have internal predecessors, (3620), 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-04-28 20:12:38,384 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 362.0) internal successors, (3620), 10 states have internal predecessors, (3620), 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-04-28 20:12:38,384 INFO L185 Difference]: Start difference. First operand has 75 places, 107 transitions, 607 flow. Second operand 9 states and 2468 transitions. [2021-04-28 20:12:38,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 129 transitions, 948 flow [2021-04-28 20:12:39,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 129 transitions, 938 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-04-28 20:12:39,432 INFO L241 Difference]: Finished difference. Result has 84 places, 94 transitions, 721 flow [2021-04-28 20:12:39,432 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=721, PETRI_PLACES=84, PETRI_TRANSITIONS=94} [2021-04-28 20:12:39,433 INFO L343 CegarLoopForPetriNet]: 135 programPoint places, -51 predicate places. [2021-04-28 20:12:39,433 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:12:39,433 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 94 transitions, 721 flow [2021-04-28 20:12:39,433 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 94 transitions, 721 flow [2021-04-28 20:12:39,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 94 transitions, 721 flow [2021-04-28 20:12:39,681 INFO L129 PetriNetUnfolder]: 530/2374 cut-off events. [2021-04-28 20:12:39,682 INFO L130 PetriNetUnfolder]: For 2928/6276 co-relation queries the response was YES. [2021-04-28 20:12:39,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10398 conditions, 2374 events. 530/2374 cut-off events. For 2928/6276 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 31880 event pairs, 1 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 10376. Up to 1584 conditions per place. [2021-04-28 20:12:39,726 INFO L146 LiptonReduction]: Number of co-enabled transitions 1540 [2021-04-28 20:12:41,049 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-04-28 20:12:41,987 WARN L205 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-04-28 20:12:44,284 WARN L205 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-04-28 20:12:45,331 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 255 [2021-04-28 20:12:45,674 INFO L158 LiptonReduction]: Checked pairs total: 3487 [2021-04-28 20:12:45,674 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-28 20:12:45,674 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6241 [2021-04-28 20:12:45,676 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 94 transitions, 723 flow [2021-04-28 20:12:45,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 264.8333333333333) internal successors, (1589), 6 states have internal predecessors, (1589), 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-04-28 20:12:45,677 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:12:45,678 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-04-28 20:12:45,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-28 20:12:45,678 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 20:12:45,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:12:45,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1664243131, now seen corresponding path program 1 times [2021-04-28 20:12:45,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:12:45,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489788149] [2021-04-28 20:12:45,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:12:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-28 20:12:45,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:45,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-28 20:12:45,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:45,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:45,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-28 20:12:45,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-28 20:12:45,773 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-04-28 20:12:45,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-28 20:12:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-28 20:12:45,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489788149] [2021-04-28 20:12:45,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-28 20:12:45,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-28 20:12:45,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041914666] [2021-04-28 20:12:45,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-28 20:12:45,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-28 20:12:45,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-28 20:12:45,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-28 20:12:45,789 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 363 [2021-04-28 20:12:45,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 94 transitions, 723 flow. Second operand has 5 states, 5 states have (on average 210.4) internal successors, (1052), 5 states have internal predecessors, (1052), 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-04-28 20:12:45,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-28 20:12:45,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 363 [2021-04-28 20:12:45,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-28 20:12:46,255 INFO L129 PetriNetUnfolder]: 817/3528 cut-off events. [2021-04-28 20:12:46,256 INFO L130 PetriNetUnfolder]: For 4525/8869 co-relation queries the response was YES. [2021-04-28 20:12:46,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15629 conditions, 3528 events. 817/3528 cut-off events. For 4525/8869 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 47714 event pairs, 1 based on Foata normal form. 27/970 useless extension candidates. Maximal degree in co-relation 15605. Up to 2376 conditions per place. [2021-04-28 20:12:46,280 INFO L132 encePairwiseOnDemand]: 358/363 looper letters, 4 selfloop transitions, 3 changer transitions 51/100 dead transitions. [2021-04-28 20:12:46,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 100 transitions, 781 flow [2021-04-28 20:12:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-28 20:12:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-28 20:12:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1270 transitions. [2021-04-28 20:12:46,286 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5831037649219467 [2021-04-28 20:12:46,286 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1270 transitions. [2021-04-28 20:12:46,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1270 transitions. [2021-04-28 20:12:46,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-28 20:12:46,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1270 transitions. [2021-04-28 20:12:46,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 211.66666666666666) internal successors, (1270), 6 states have internal predecessors, (1270), 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-04-28 20:12:46,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 363.0) internal successors, (2541), 7 states have internal predecessors, (2541), 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-04-28 20:12:46,297 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 363.0) internal successors, (2541), 7 states have internal predecessors, (2541), 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-04-28 20:12:46,297 INFO L185 Difference]: Start difference. First operand has 76 places, 94 transitions, 723 flow. Second operand 6 states and 1270 transitions. [2021-04-28 20:12:46,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 100 transitions, 781 flow [2021-04-28 20:12:47,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 100 transitions, 571 flow, removed 48 selfloop flow, removed 9 redundant places. [2021-04-28 20:12:47,348 INFO L241 Difference]: Finished difference. Result has 73 places, 49 transitions, 236 flow [2021-04-28 20:12:47,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=363, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2021-04-28 20:12:47,349 INFO L343 CegarLoopForPetriNet]: 135 programPoint places, -62 predicate places. [2021-04-28 20:12:47,349 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-28 20:12:47,349 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 49 transitions, 236 flow [2021-04-28 20:12:47,349 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 49 transitions, 236 flow [2021-04-28 20:12:47,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 236 flow [2021-04-28 20:12:47,379 INFO L129 PetriNetUnfolder]: 100/291 cut-off events. [2021-04-28 20:12:47,379 INFO L130 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2021-04-28 20:12:47,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 291 events. 100/291 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1644 event pairs, 1 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 817. Up to 118 conditions per place. [2021-04-28 20:12:47,383 INFO L146 LiptonReduction]: Number of co-enabled transitions 490 [2021-04-28 20:12:47,659 INFO L158 LiptonReduction]: Checked pairs total: 800 [2021-04-28 20:12:47,660 INFO L160 LiptonReduction]: Total number of compositions: 2 [2021-04-28 20:12:47,660 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 311 [2021-04-28 20:12:47,661 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 238 flow [2021-04-28 20:12:47,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 210.4) internal successors, (1052), 5 states have internal predecessors, (1052), 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-04-28 20:12:47,662 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-28 20:12:47,662 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-28 20:12:47,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-28 20:12:47,662 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-28 20:12:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-28 20:12:47,663 INFO L82 PathProgramCache]: Analyzing trace with hash -513552427, now seen corresponding path program 1 times [2021-04-28 20:12:47,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-28 20:12:47,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706855770] [2021-04-28 20:12:47,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-28 20:12:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-28 20:12:47,721 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-28 20:12:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-28 20:12:47,776 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-28 20:12:47,840 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-28 20:12:47,840 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-28 20:12:47,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-28 20:12:47,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 08:12:47 BasicIcfg [2021-04-28 20:12:47,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-28 20:12:47,979 INFO L168 Benchmark]: Toolchain (without parser) took 66867.24 ms. Allocated memory was 310.4 MB in the beginning and 1.2 GB in the end (delta: 878.7 MB). Free memory was 283.5 MB in the beginning and 446.7 MB in the end (delta: -163.2 MB). Peak memory consumption was 717.2 MB. Max. memory is 16.0 GB. [2021-04-28 20:12:47,979 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 310.4 MB. Free memory is still 278.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-28 20:12:47,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.14 ms. Allocated memory is still 310.4 MB. Free memory was 280.4 MB in the beginning and 276.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 16.0 GB. [2021-04-28 20:12:47,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.90 ms. Allocated memory is still 310.4 MB. Free memory was 276.9 MB in the beginning and 273.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-28 20:12:47,980 INFO L168 Benchmark]: Boogie Preprocessor took 81.45 ms. Allocated memory is still 310.4 MB. Free memory was 273.7 MB in the beginning and 271.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-28 20:12:47,981 INFO L168 Benchmark]: RCFGBuilder took 2286.16 ms. Allocated memory was 310.4 MB in the beginning and 385.9 MB in the end (delta: 75.5 MB). Free memory was 271.6 MB in the beginning and 318.3 MB in the end (delta: -46.7 MB). Peak memory consumption was 166.2 MB. Max. memory is 16.0 GB. [2021-04-28 20:12:47,981 INFO L168 Benchmark]: TraceAbstraction took 63518.21 ms. Allocated memory was 385.9 MB in the beginning and 1.2 GB in the end (delta: 803.2 MB). Free memory was 317.2 MB in the beginning and 446.7 MB in the end (delta: -129.5 MB). Peak memory consumption was 672.7 MB. Max. memory is 16.0 GB. [2021-04-28 20:12:47,983 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.75 ms. Allocated memory is still 310.4 MB. Free memory is still 278.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 850.14 ms. Allocated memory is still 310.4 MB. Free memory was 280.4 MB in the beginning and 276.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.90 ms. Allocated memory is still 310.4 MB. Free memory was 276.9 MB in the beginning and 273.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 81.45 ms. Allocated memory is still 310.4 MB. Free memory was 273.7 MB in the beginning and 271.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2286.16 ms. Allocated memory was 310.4 MB in the beginning and 385.9 MB in the end (delta: 75.5 MB). Free memory was 271.6 MB in the beginning and 318.3 MB in the end (delta: -46.7 MB). Peak memory consumption was 166.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 63518.21 ms. Allocated memory was 385.9 MB in the beginning and 1.2 GB in the end (delta: 803.2 MB). Free memory was 317.2 MB in the beginning and 446.7 MB in the end (delta: -129.5 MB). Peak memory consumption was 672.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33044.2ms, 107 PlacesBefore, 135 PlacesAfterwards, 99 TransitionsBefore, 126 TransitionsAfterwards, 1750 CoEnabledTransitionPairs, 8 FixpointIterations, 158 TrivialSequentialCompositions, 99 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 259 TotalNumberOfCompositions, 16010 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4414, positive: 4152, positive conditional: 4152, positive unconditional: 0, negative: 262, negative conditional: 262, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2162, positive: 2096, positive conditional: 0, positive unconditional: 2096, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2162, positive: 2096, positive conditional: 0, positive unconditional: 2096, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2162, positive: 2085, positive conditional: 0, positive unconditional: 2085, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 736, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 691, negative conditional: 0, negative unconditional: 691, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4414, positive: 2056, positive conditional: 2056, positive unconditional: 0, negative: 196, negative conditional: 196, negative unconditional: 0, unknown: 2162, unknown conditional: 2162, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2162, Positive cache size: 2096, Positive conditional cache size: 2096, Positive unconditional cache size: 0, Negative cache size: 66, Negative conditional cache size: 66, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 267.9ms, 131 PlacesBefore, 78 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 2220 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2714 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 560, positive: 482, positive conditional: 482, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 256, positive: 234, positive conditional: 1, positive unconditional: 233, 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: 256, positive: 234, positive conditional: 1, positive unconditional: 233, 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: 256, positive: 234, positive conditional: 0, positive unconditional: 234, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 241, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 241, negative conditional: 0, negative unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 560, positive: 248, positive conditional: 248, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 256, unknown conditional: 256, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2418, Positive cache size: 2330, Positive conditional cache size: 2330, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 147.6ms, 79 PlacesBefore, 56 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 1276 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 117, positive: 96, positive conditional: 96, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 27, positive conditional: 1, positive unconditional: 26, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, positive: 27, positive conditional: 1, positive unconditional: 26, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 6, negative conditional: 1, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 101, negative conditional: 5, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2451, Positive cache size: 2357, Positive conditional cache size: 2357, Positive unconditional cache size: 0, Negative cache size: 94, Negative conditional cache size: 94, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.6ms, 58 PlacesBefore, 58 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 1268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 668 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 100, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2451, Positive cache size: 2357, Positive conditional cache size: 2357, Positive unconditional cache size: 0, Negative cache size: 94, Negative conditional cache size: 94, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 891.1ms, 63 PlacesBefore, 63 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1704 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1307 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 152, positive: 128, positive conditional: 128, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 42, positive conditional: 24, positive unconditional: 18, 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: 45, positive: 42, positive conditional: 24, positive unconditional: 18, 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: 45, positive: 42, positive conditional: 0, positive unconditional: 42, 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: 68, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 152, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 45, unknown conditional: 45, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2496, Positive cache size: 2399, Positive conditional cache size: 2399, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1404.4ms, 72 PlacesBefore, 72 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 2170 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2525 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 845, positive: 809, positive conditional: 809, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, positive: 96, positive conditional: 77, positive unconditional: 19, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 99, positive: 96, positive conditional: 77, positive unconditional: 19, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 99, positive: 96, positive conditional: 0, positive unconditional: 96, 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: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 162, negative conditional: 48, negative unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 845, positive: 713, positive conditional: 713, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 99, unknown conditional: 99, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2495, Positive conditional cache size: 2495, Positive unconditional cache size: 0, Negative cache size: 100, Negative conditional cache size: 100, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9354.9ms, 74 PlacesBefore, 75 PlacesAfterwards, 106 TransitionsBefore, 107 TransitionsAfterwards, 2230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4913 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1581, positive: 1513, positive conditional: 1513, positive unconditional: 0, negative: 68, negative conditional: 68, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, positive: 133, positive conditional: 98, positive unconditional: 35, 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: 134, positive: 133, positive conditional: 98, positive unconditional: 35, 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: 134, positive: 133, positive conditional: 0, positive unconditional: 133, 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: 49, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1581, positive: 1380, positive conditional: 1380, positive unconditional: 0, negative: 67, negative conditional: 67, negative unconditional: 0, unknown: 134, unknown conditional: 134, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2729, Positive cache size: 2628, Positive conditional cache size: 2628, Positive unconditional cache size: 0, Negative cache size: 101, Negative conditional cache size: 101, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6240.9ms, 84 PlacesBefore, 76 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 1540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3487 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1460, positive: 1404, positive conditional: 1404, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, positive: 168, positive conditional: 149, positive unconditional: 19, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 170, positive: 168, positive conditional: 149, positive unconditional: 19, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 170, positive: 168, positive conditional: 0, positive unconditional: 168, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1460, positive: 1236, positive conditional: 1236, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 170, unknown conditional: 170, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2899, Positive cache size: 2796, Positive conditional cache size: 2796, Positive unconditional cache size: 0, Negative cache size: 103, Negative conditional cache size: 103, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 310.2ms, 73 PlacesBefore, 56 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 800 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 503, positive: 467, positive conditional: 467, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 31, positive conditional: 21, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, positive: 31, positive conditional: 21, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 82, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 503, positive: 436, positive conditional: 436, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2932, Positive cache size: 2827, Positive conditional cache size: 2827, Positive unconditional cache size: 0, Negative cache size: 105, Negative conditional cache size: 105, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [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_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 z = 1 [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L758] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L760] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L762] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L763] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L856] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 14.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 63227.0ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 9860.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 33157.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 82 SDtfs, 86 SDslu, 20 SDs, 0 SdLazy, 365 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 459.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 150.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=725occurred in iteration=5, InterpolantAutomatonStates: 40, 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: 47.6ms SsaConstructionTime, 462.2ms SatisfiabilityAnalysisTime, 642.0ms InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...