/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.opt.0.1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:30:48,343 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:30:48,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:30:48,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:30:48,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:30:48,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:30:48,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:30:48,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:30:48,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:30:48,441 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:30:48,442 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:30:48,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:30:48,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:30:48,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:30:48,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:30:48,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:30:48,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:30:48,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:30:48,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:30:48,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:30:48,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:30:48,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:30:48,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:30:48,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:30:48,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:30:48,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:30:48,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:30:48,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:30:48,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:30:48,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:30:48,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:30:48,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:30:48,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:30:48,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:30:48,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:30:48,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:30:48,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:30:48,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:30:48,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:30:48,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:30:48,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:30:48,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 15:30:48,554 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:30:48,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:30:48,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:30:48,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:30:48,557 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:30:48,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:30:48,558 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:30:48,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:30:48,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:30:48,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:30:48,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:30:48,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:30:48,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:30:48,559 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:30:48,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:30:48,560 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:30:48,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:30:48,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:30:48,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:30:48,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:30:48,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:30:48,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:30:48,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:30:48,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:30:48,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:30:48,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:30:48,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:30:48,562 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:30:48,562 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:30:48,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:30:48,562 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-06-11 15:30:48,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:30:48,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:30:48,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:30:48,879 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:30:48,880 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:30:48,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_rmo.opt.0.1.i [2021-06-11 15:30:48,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf65cf21d/672ab952613940f78c483d21d14b8d05/FLAG0c3caa76a [2021-06-11 15:30:49,402 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:30:49,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_rmo.opt.0.1.i [2021-06-11 15:30:49,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf65cf21d/672ab952613940f78c483d21d14b8d05/FLAG0c3caa76a [2021-06-11 15:30:49,434 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf65cf21d/672ab952613940f78c483d21d14b8d05 [2021-06-11 15:30:49,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:30:49,438 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:30:49,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:30:49,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:30:49,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:30:49,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:30:49" (1/1) ... [2021-06-11 15:30:49,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6790745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:49, skipping insertion in model container [2021-06-11 15:30:49,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:30:49" (1/1) ... [2021-06-11 15:30:49,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:30:49,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:30:49,695 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/mix003_rmo.opt.0.1.i[952,965] [2021-06-11 15:30:49,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:30:49,912 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:30:49,926 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/mix003_rmo.opt.0.1.i[952,965] [2021-06-11 15:30:49,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:30:50,052 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:30:50,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50 WrapperNode [2021-06-11 15:30:50,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:30:50,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:30:50,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:30:50,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:30:50,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (1/1) ... [2021-06-11 15:30:50,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (1/1) ... [2021-06-11 15:30:50,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:30:50,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:30:50,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:30:50,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:30:50,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (1/1) ... [2021-06-11 15:30:50,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (1/1) ... [2021-06-11 15:30:50,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (1/1) ... [2021-06-11 15:30:50,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (1/1) ... [2021-06-11 15:30:50,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (1/1) ... [2021-06-11 15:30:50,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (1/1) ... [2021-06-11 15:30:50,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (1/1) ... [2021-06-11 15:30:50,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:30:50,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:30:50,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:30:50,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:30:50,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (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-06-11 15:30:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:30:50,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:30:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:30:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:30:50,275 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:30:50,275 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:30:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:30:50,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:30:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:30:50,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:30:50,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:30:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:30:50,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:30:50,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:30:50,278 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:30:52,271 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:30:52,272 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:30:52,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:30:52 BoogieIcfgContainer [2021-06-11 15:30:52,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:30:52,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:30:52,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:30:52,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:30:52,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:30:49" (1/3) ... [2021-06-11 15:30:52,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3b9206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:30:52, skipping insertion in model container [2021-06-11 15:30:52,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:30:50" (2/3) ... [2021-06-11 15:30:52,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e3b9206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:30:52, skipping insertion in model container [2021-06-11 15:30:52,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:30:52" (3/3) ... [2021-06-11 15:30:52,279 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003_rmo.opt.0.1.i [2021-06-11 15:30:52,285 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:30:52,288 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:30:52,289 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:30:52,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,323 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,323 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,324 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,324 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,325 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,328 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,338 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,338 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,338 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,352 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,355 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,356 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,356 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,359 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:30:52,363 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:30:52,379 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 15:30:52,396 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:30:52,396 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:30:52,396 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:30:52,396 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:30:52,396 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:30:52,396 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:30:52,396 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:30:52,396 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:30:52,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-06-11 15:30:52,436 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-06-11 15:30:52,436 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:30:52,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 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/94 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-11 15:30:52,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 217 flow [2021-06-11 15:30:52,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2021-06-11 15:30:52,444 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:30:52,455 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 205 flow [2021-06-11 15:30:52,458 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 205 flow [2021-06-11 15:30:52,459 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 205 flow [2021-06-11 15:30:52,476 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-06-11 15:30:52,476 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:30:52,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 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/94 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-11 15:30:52,479 INFO L151 LiptonReduction]: Number of co-enabled transitions 1658 [2021-06-11 15:30:52,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:52,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:30:52,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:30:52,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:52,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:52,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:53,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:53,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,120 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:53,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:30:53,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:30:53,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,240 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:53,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:30:53,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:30:53,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:53,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:53,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:53,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:53,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:53,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:53,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,671 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:30:53,672 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:30:53,699 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:53,857 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:30:53,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:53,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:53,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:54,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:30:54,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:30:54,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:54,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:54,867 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:30:55,281 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 15:30:55,404 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 15:30:55,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:55,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:30:55,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:55,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,435 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 15:30:55,436 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:30:55,438 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,441 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 15:30:55,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:55,443 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 15:30:55,444 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 15:30:55,444 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:30:55,446 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,448 INFO L147 QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50 [2021-06-11 15:30:55,448 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 15:30:55,449 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:30:55,464 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,468 INFO L147 QuantifierPusher]: treesize reduction 189, result has 28.4 percent of original size 75 [2021-06-11 15:30:55,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:55,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:55,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:30:55,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:30:55,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:55,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:55,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:55,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:56,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:56,055 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:56,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:56,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:30:56,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:30:56,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:56,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:56,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:56,147 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:30:56,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:56,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:56,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:56,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:56,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:56,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:56,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:56,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:56,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:56,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:57,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:57,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:57,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:57,201 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:57,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:57,202 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:57,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:57,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:30:57,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:30:57,204 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:57,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:57,205 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:57,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:57,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:30:57,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:30:57,207 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:57,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:57,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:30:57,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:30:57,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:57,391 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:57,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:57,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:30:57,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:30:57,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:57,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:30:58,138 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-06-11 15:30:58,314 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-11 15:30:58,708 WARN L205 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-06-11 15:30:58,870 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-06-11 15:30:58,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:58,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:30:58,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:58,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:30:58,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:30:58,899 INFO L163 LiptonReduction]: Checked pairs total: 4725 [2021-06-11 15:30:58,899 INFO L165 LiptonReduction]: Total number of compositions: 92 [2021-06-11 15:30:58,902 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6459 [2021-06-11 15:30:58,910 INFO L129 PetriNetUnfolder]: 1/14 cut-off events. [2021-06-11 15:30:58,910 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:30:58,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:30:58,911 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:30:58,911 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:30:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:30:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1497726843, now seen corresponding path program 1 times [2021-06-11 15:30:58,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:30:58,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366015692] [2021-06-11 15:30:58,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:30:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:30:59,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:59,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:30:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:30:59,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366015692] [2021-06-11 15:30:59,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:30:59,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:30:59,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833696110] [2021-06-11 15:30:59,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:30:59,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:30:59,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:30:59,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:30:59,179 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2021-06-11 15:30:59,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-06-11 15:30:59,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:30:59,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2021-06-11 15:30:59,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:30:59,252 INFO L129 PetriNetUnfolder]: 13/61 cut-off events. [2021-06-11 15:30:59,252 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:30:59,252 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 61 events. 13/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 203 event pairs, 5 based on Foata normal form. 16/68 useless extension candidates. Maximal degree in co-relation 91. Up to 25 conditions per place. [2021-06-11 15:30:59,253 INFO L132 encePairwiseOnDemand]: 188/193 looper letters, 6 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2021-06-11 15:30:59,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 25 transitions, 75 flow [2021-06-11 15:30:59,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:30:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:30:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2021-06-11 15:30:59,272 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8618307426597582 [2021-06-11 15:30:59,272 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2021-06-11 15:30:59,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2021-06-11 15:30:59,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:30:59,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2021-06-11 15:30:59,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-06-11 15:30:59,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-06-11 15:30:59,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-06-11 15:30:59,290 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 499 transitions. [2021-06-11 15:30:59,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 25 transitions, 75 flow [2021-06-11 15:30:59,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 72 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 15:30:59,293 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2021-06-11 15:30:59,294 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-06-11 15:30:59,294 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-11 15:30:59,294 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:30:59,295 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 56 flow [2021-06-11 15:30:59,295 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 56 flow [2021-06-11 15:30:59,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 56 flow [2021-06-11 15:30:59,299 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-06-11 15:30:59,299 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:30:59,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:30:59,299 INFO L151 LiptonReduction]: Number of co-enabled transitions 254 [2021-06-11 15:30:59,508 INFO L163 LiptonReduction]: Checked pairs total: 306 [2021-06-11 15:30:59,508 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:30:59,509 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 215 [2021-06-11 15:30:59,509 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-06-11 15:30:59,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-06-11 15:30:59,510 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:30:59,510 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:30:59,510 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 15:30:59,511 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:30:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:30:59,511 INFO L82 PathProgramCache]: Analyzing trace with hash 501506619, now seen corresponding path program 1 times [2021-06-11 15:30:59,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:30:59,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950513273] [2021-06-11 15:30:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:30:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:30:59,601 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:30:59,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:30:59,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-06-11 15:30:59,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950513273] [2021-06-11 15:30:59,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:30:59,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:30:59,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422957970] [2021-06-11 15:30:59,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:30:59,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:30:59,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:30:59,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:30:59,615 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 193 [2021-06-11 15:30:59,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-06-11 15:30:59,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:30:59,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 193 [2021-06-11 15:30:59,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:30:59,682 INFO L129 PetriNetUnfolder]: 92/214 cut-off events. [2021-06-11 15:30:59,682 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:30:59,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 214 events. 92/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1078 event pairs, 32 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 378. Up to 144 conditions per place. [2021-06-11 15:30:59,684 INFO L132 encePairwiseOnDemand]: 185/193 looper letters, 6 selfloop transitions, 4 changer transitions 4/29 dead transitions. [2021-06-11 15:30:59,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 96 flow [2021-06-11 15:30:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:30:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:30:59,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2021-06-11 15:30:59,686 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8031088082901554 [2021-06-11 15:30:59,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2021-06-11 15:30:59,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2021-06-11 15:30:59,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:30:59,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2021-06-11 15:30:59,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-06-11 15:30:59,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-06-11 15:30:59,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-06-11 15:30:59,690 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 465 transitions. [2021-06-11 15:30:59,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 96 flow [2021-06-11 15:30:59,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:30:59,691 INFO L241 Difference]: Finished difference. Result has 33 places, 25 transitions, 80 flow [2021-06-11 15:30:59,691 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2021-06-11 15:30:59,692 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-06-11 15:30:59,692 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:30:59,692 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 80 flow [2021-06-11 15:30:59,692 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 80 flow [2021-06-11 15:30:59,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 80 flow [2021-06-11 15:30:59,707 INFO L129 PetriNetUnfolder]: 46/116 cut-off events. [2021-06-11 15:30:59,707 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:30:59,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 116 events. 46/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 461 event pairs, 32 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 201. Up to 81 conditions per place. [2021-06-11 15:30:59,709 INFO L151 LiptonReduction]: Number of co-enabled transitions 242 [2021-06-11 15:30:59,711 INFO L163 LiptonReduction]: Checked pairs total: 163 [2021-06-11 15:30:59,711 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:30:59,711 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-06-11 15:30:59,712 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 80 flow [2021-06-11 15:30:59,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-06-11 15:30:59,713 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:30:59,713 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:30:59,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 15:30:59,713 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:30:59,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:30:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash 911513201, now seen corresponding path program 1 times [2021-06-11 15:30:59,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:30:59,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408007345] [2021-06-11 15:30:59,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:30:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:30:59,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:59,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:30:59,767 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:30:59,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:30:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:30:59,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408007345] [2021-06-11 15:30:59,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:30:59,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:30:59,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390047242] [2021-06-11 15:30:59,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:30:59,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:30:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:30:59,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:30:59,779 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 193 [2021-06-11 15:30:59,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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-06-11 15:30:59,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:30:59,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 193 [2021-06-11 15:30:59,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:30:59,815 INFO L129 PetriNetUnfolder]: 36/92 cut-off events. [2021-06-11 15:30:59,815 INFO L130 PetriNetUnfolder]: For 12/51 co-relation queries the response was YES. [2021-06-11 15:30:59,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 92 events. 36/92 cut-off events. For 12/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 308 event pairs, 6 based on Foata normal form. 2/91 useless extension candidates. Maximal degree in co-relation 227. Up to 66 conditions per place. [2021-06-11 15:30:59,817 INFO L132 encePairwiseOnDemand]: 190/193 looper letters, 10 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-06-11 15:30:59,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 118 flow [2021-06-11 15:30:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:30:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:30:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2021-06-11 15:30:59,819 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7962003454231433 [2021-06-11 15:30:59,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2021-06-11 15:30:59,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2021-06-11 15:30:59,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:30:59,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2021-06-11 15:30:59,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-06-11 15:30:59,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-06-11 15:30:59,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-06-11 15:30:59,822 INFO L185 Difference]: Start difference. First operand has 32 places, 25 transitions, 80 flow. Second operand 3 states and 461 transitions. [2021-06-11 15:30:59,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 118 flow [2021-06-11 15:30:59,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:30:59,824 INFO L241 Difference]: Finished difference. Result has 34 places, 25 transitions, 87 flow [2021-06-11 15:30:59,824 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2021-06-11 15:30:59,824 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2021-06-11 15:30:59,824 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:30:59,825 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 25 transitions, 87 flow [2021-06-11 15:30:59,825 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 25 transitions, 87 flow [2021-06-11 15:30:59,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 87 flow [2021-06-11 15:30:59,836 INFO L129 PetriNetUnfolder]: 36/99 cut-off events. [2021-06-11 15:30:59,837 INFO L130 PetriNetUnfolder]: For 18/21 co-relation queries the response was YES. [2021-06-11 15:30:59,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 99 events. 36/99 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 362 event pairs, 29 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 190. Up to 66 conditions per place. [2021-06-11 15:30:59,838 INFO L151 LiptonReduction]: Number of co-enabled transitions 240 [2021-06-11 15:30:59,840 INFO L163 LiptonReduction]: Checked pairs total: 161 [2021-06-11 15:30:59,840 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:30:59,840 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-06-11 15:30:59,841 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 87 flow [2021-06-11 15:30:59,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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-06-11 15:30:59,842 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:30:59,842 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:30:59,842 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 15:30:59,842 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:30:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:30:59,845 INFO L82 PathProgramCache]: Analyzing trace with hash 911519401, now seen corresponding path program 1 times [2021-06-11 15:30:59,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:30:59,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412304421] [2021-06-11 15:30:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:30:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:30:59,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:30:59,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:30:59,977 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:30:59,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:30:59,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:30:59,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412304421] [2021-06-11 15:30:59,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:30:59,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:30:59,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481993620] [2021-06-11 15:30:59,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:30:59,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:30:59,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:30:59,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:30:59,990 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 193 [2021-06-11 15:30:59,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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-06-11 15:30:59,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:30:59,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 193 [2021-06-11 15:30:59,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:31:00,057 INFO L129 PetriNetUnfolder]: 28/83 cut-off events. [2021-06-11 15:31:00,057 INFO L130 PetriNetUnfolder]: For 37/80 co-relation queries the response was YES. [2021-06-11 15:31:00,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 83 events. 28/83 cut-off events. For 37/80 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 277 event pairs, 8 based on Foata normal form. 6/87 useless extension candidates. Maximal degree in co-relation 211. Up to 54 conditions per place. [2021-06-11 15:31:00,058 INFO L132 encePairwiseOnDemand]: 190/193 looper letters, 10 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-06-11 15:31:00,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 128 flow [2021-06-11 15:31:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:31:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:31:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2021-06-11 15:31:00,061 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7962003454231433 [2021-06-11 15:31:00,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2021-06-11 15:31:00,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2021-06-11 15:31:00,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:31:00,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2021-06-11 15:31:00,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-06-11 15:31:00,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-06-11 15:31:00,065 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 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-06-11 15:31:00,065 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 87 flow. Second operand 3 states and 461 transitions. [2021-06-11 15:31:00,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 128 flow [2021-06-11 15:31:00,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:31:00,066 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 92 flow [2021-06-11 15:31:00,066 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2021-06-11 15:31:00,066 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2021-06-11 15:31:00,067 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:31:00,067 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 92 flow [2021-06-11 15:31:00,067 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 92 flow [2021-06-11 15:31:00,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 92 flow [2021-06-11 15:31:00,078 INFO L129 PetriNetUnfolder]: 28/90 cut-off events. [2021-06-11 15:31:00,078 INFO L130 PetriNetUnfolder]: For 31/41 co-relation queries the response was YES. [2021-06-11 15:31:00,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 90 events. 28/90 cut-off events. For 31/41 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 337 event pairs, 21 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 179. Up to 54 conditions per place. [2021-06-11 15:31:00,080 INFO L151 LiptonReduction]: Number of co-enabled transitions 238 [2021-06-11 15:31:00,082 INFO L163 LiptonReduction]: Checked pairs total: 159 [2021-06-11 15:31:00,082 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:31:00,082 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-06-11 15:31:00,083 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 92 flow [2021-06-11 15:31:00,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 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-06-11 15:31:00,083 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:31:00,083 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:31:00,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 15:31:00,083 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:31:00,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:31:00,084 INFO L82 PathProgramCache]: Analyzing trace with hash -208327044, now seen corresponding path program 1 times [2021-06-11 15:31:00,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:31:00,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833300694] [2021-06-11 15:31:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:31:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:31:00,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:00,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:00,161 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:31:00,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:31:00,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:00,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:31:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:31:00,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833300694] [2021-06-11 15:31:00,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:31:00,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:31:00,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152861096] [2021-06-11 15:31:00,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:31:00,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:31:00,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:31:00,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:31:00,171 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 193 [2021-06-11 15:31:00,171 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 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-06-11 15:31:00,171 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:31:00,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 193 [2021-06-11 15:31:00,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:31:00,230 INFO L129 PetriNetUnfolder]: 114/265 cut-off events. [2021-06-11 15:31:00,231 INFO L130 PetriNetUnfolder]: For 63/67 co-relation queries the response was YES. [2021-06-11 15:31:00,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 265 events. 114/265 cut-off events. For 63/67 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1445 event pairs, 39 based on Foata normal form. 21/233 useless extension candidates. Maximal degree in co-relation 570. Up to 105 conditions per place. [2021-06-11 15:31:00,233 INFO L132 encePairwiseOnDemand]: 186/193 looper letters, 8 selfloop transitions, 10 changer transitions 0/36 dead transitions. [2021-06-11 15:31:00,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 150 flow [2021-06-11 15:31:00,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:31:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:31:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 780 transitions. [2021-06-11 15:31:00,236 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8082901554404145 [2021-06-11 15:31:00,236 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 780 transitions. [2021-06-11 15:31:00,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 780 transitions. [2021-06-11 15:31:00,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:31:00,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 780 transitions. [2021-06-11 15:31:00,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 156.0) internal successors, (780), 5 states have internal predecessors, (780), 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-06-11 15:31:00,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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-06-11 15:31:00,241 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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-06-11 15:31:00,241 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 92 flow. Second operand 5 states and 780 transitions. [2021-06-11 15:31:00,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 150 flow [2021-06-11 15:31:00,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:31:00,244 INFO L241 Difference]: Finished difference. Result has 40 places, 33 transitions, 155 flow [2021-06-11 15:31:00,245 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2021-06-11 15:31:00,245 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2021-06-11 15:31:00,245 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:31:00,245 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 33 transitions, 155 flow [2021-06-11 15:31:00,247 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 33 transitions, 155 flow [2021-06-11 15:31:00,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 155 flow [2021-06-11 15:31:00,278 INFO L129 PetriNetUnfolder]: 95/228 cut-off events. [2021-06-11 15:31:00,278 INFO L130 PetriNetUnfolder]: For 173/241 co-relation queries the response was YES. [2021-06-11 15:31:00,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 228 events. 95/228 cut-off events. For 173/241 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1268 event pairs, 47 based on Foata normal form. 5/205 useless extension candidates. Maximal degree in co-relation 623. Up to 114 conditions per place. [2021-06-11 15:31:00,281 INFO L151 LiptonReduction]: Number of co-enabled transitions 330 [2021-06-11 15:31:00,297 INFO L163 LiptonReduction]: Checked pairs total: 179 [2021-06-11 15:31:00,297 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:31:00,298 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-06-11 15:31:00,301 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 155 flow [2021-06-11 15:31:00,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 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-06-11 15:31:00,302 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:31:00,302 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:31:00,302 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 15:31:00,302 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:31:00,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:31:00,310 INFO L82 PathProgramCache]: Analyzing trace with hash 618053019, now seen corresponding path program 1 times [2021-06-11 15:31:00,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:31:00,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463193253] [2021-06-11 15:31:00,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:31:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:31:00,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:00,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:00,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:00,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:00,464 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:31:00,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:31:00,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:00,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:31:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:31:00,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463193253] [2021-06-11 15:31:00,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:31:00,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:31:00,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197785918] [2021-06-11 15:31:00,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:31:00,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:31:00,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:31:00,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:31:00,475 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 193 [2021-06-11 15:31:00,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 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-06-11 15:31:00,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:31:00,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 193 [2021-06-11 15:31:00,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:31:00,569 INFO L129 PetriNetUnfolder]: 81/215 cut-off events. [2021-06-11 15:31:00,569 INFO L130 PetriNetUnfolder]: For 310/702 co-relation queries the response was YES. [2021-06-11 15:31:00,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 215 events. 81/215 cut-off events. For 310/702 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1114 event pairs, 11 based on Foata normal form. 82/270 useless extension candidates. Maximal degree in co-relation 716. Up to 108 conditions per place. [2021-06-11 15:31:00,571 INFO L132 encePairwiseOnDemand]: 186/193 looper letters, 5 selfloop transitions, 18 changer transitions 3/44 dead transitions. [2021-06-11 15:31:00,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 270 flow [2021-06-11 15:31:00,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:31:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:31:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1092 transitions. [2021-06-11 15:31:00,574 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8082901554404145 [2021-06-11 15:31:00,575 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1092 transitions. [2021-06-11 15:31:00,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1092 transitions. [2021-06-11 15:31:00,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:31:00,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1092 transitions. [2021-06-11 15:31:00,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 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-06-11 15:31:00,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 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-06-11 15:31:00,581 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 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-06-11 15:31:00,581 INFO L185 Difference]: Start difference. First operand has 40 places, 33 transitions, 155 flow. Second operand 7 states and 1092 transitions. [2021-06-11 15:31:00,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 270 flow [2021-06-11 15:31:00,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:31:00,586 INFO L241 Difference]: Finished difference. Result has 49 places, 41 transitions, 268 flow [2021-06-11 15:31:00,586 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2021-06-11 15:31:00,586 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2021-06-11 15:31:00,586 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:31:00,586 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 268 flow [2021-06-11 15:31:00,587 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 268 flow [2021-06-11 15:31:00,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 268 flow [2021-06-11 15:31:00,608 INFO L129 PetriNetUnfolder]: 68/184 cut-off events. [2021-06-11 15:31:00,608 INFO L130 PetriNetUnfolder]: For 516/662 co-relation queries the response was YES. [2021-06-11 15:31:00,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 184 events. 68/184 cut-off events. For 516/662 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 996 event pairs, 14 based on Foata normal form. 1/164 useless extension candidates. Maximal degree in co-relation 689. Up to 88 conditions per place. [2021-06-11 15:31:00,611 INFO L151 LiptonReduction]: Number of co-enabled transitions 396 [2021-06-11 15:31:00,617 INFO L163 LiptonReduction]: Checked pairs total: 257 [2021-06-11 15:31:00,618 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:31:00,618 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-06-11 15:31:00,619 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 268 flow [2021-06-11 15:31:00,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 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-06-11 15:31:00,619 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:31:00,620 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:31:00,620 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 15:31:00,620 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:31:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:31:00,620 INFO L82 PathProgramCache]: Analyzing trace with hash 121018462, now seen corresponding path program 1 times [2021-06-11 15:31:00,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:31:00,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561753202] [2021-06-11 15:31:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:31:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:31:00,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:00,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:00,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:00,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:00,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:00,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:00,748 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:31:00,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:31:00,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:00,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:31:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:31:00,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561753202] [2021-06-11 15:31:00,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:31:00,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:31:00,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689313175] [2021-06-11 15:31:00,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:31:00,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:31:00,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:31:00,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:31:00,759 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 193 [2021-06-11 15:31:00,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 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-06-11 15:31:00,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:31:00,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 193 [2021-06-11 15:31:00,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:31:00,855 INFO L129 PetriNetUnfolder]: 66/185 cut-off events. [2021-06-11 15:31:00,855 INFO L130 PetriNetUnfolder]: For 914/1786 co-relation queries the response was YES. [2021-06-11 15:31:00,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 185 events. 66/185 cut-off events. For 914/1786 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 965 event pairs, 6 based on Foata normal form. 93/252 useless extension candidates. Maximal degree in co-relation 820. Up to 95 conditions per place. [2021-06-11 15:31:00,857 INFO L132 encePairwiseOnDemand]: 186/193 looper letters, 2 selfloop transitions, 22 changer transitions 4/46 dead transitions. [2021-06-11 15:31:00,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 362 flow [2021-06-11 15:31:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:31:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:31:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1398 transitions. [2021-06-11 15:31:00,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8048359240069085 [2021-06-11 15:31:00,862 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1398 transitions. [2021-06-11 15:31:00,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1398 transitions. [2021-06-11 15:31:00,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:31:00,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1398 transitions. [2021-06-11 15:31:00,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 155.33333333333334) internal successors, (1398), 9 states have internal predecessors, (1398), 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-06-11 15:31:00,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 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-06-11 15:31:00,868 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 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-06-11 15:31:00,868 INFO L185 Difference]: Start difference. First operand has 49 places, 41 transitions, 268 flow. Second operand 9 states and 1398 transitions. [2021-06-11 15:31:00,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 362 flow [2021-06-11 15:31:00,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 306 flow, removed 16 selfloop flow, removed 5 redundant places. [2021-06-11 15:31:00,876 INFO L241 Difference]: Finished difference. Result has 55 places, 42 transitions, 282 flow [2021-06-11 15:31:00,876 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=282, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2021-06-11 15:31:00,876 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2021-06-11 15:31:00,876 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:31:00,876 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 282 flow [2021-06-11 15:31:00,876 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 282 flow [2021-06-11 15:31:00,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 42 transitions, 282 flow [2021-06-11 15:31:00,895 INFO L129 PetriNetUnfolder]: 66/188 cut-off events. [2021-06-11 15:31:00,895 INFO L130 PetriNetUnfolder]: For 575/623 co-relation queries the response was YES. [2021-06-11 15:31:00,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 188 events. 66/188 cut-off events. For 575/623 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1018 event pairs, 9 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 711. Up to 56 conditions per place. [2021-06-11 15:31:00,898 INFO L151 LiptonReduction]: Number of co-enabled transitions 368 [2021-06-11 15:31:00,904 INFO L163 LiptonReduction]: Checked pairs total: 239 [2021-06-11 15:31:00,904 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:31:00,904 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-06-11 15:31:00,905 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 282 flow [2021-06-11 15:31:00,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 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-06-11 15:31:00,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:31:00,905 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-06-11 15:31:00,906 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 15:31:00,906 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:31:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:31:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1213085007, now seen corresponding path program 1 times [2021-06-11 15:31:00,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:31:00,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835636062] [2021-06-11 15:31:00,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:31:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:31:01,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:01,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:31:01,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:01,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:01,010 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:31:01,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:31:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:31:01,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835636062] [2021-06-11 15:31:01,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:31:01,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:31:01,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608965255] [2021-06-11 15:31:01,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:31:01,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:31:01,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:31:01,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:31:01,023 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 193 [2021-06-11 15:31:01,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 282 flow. Second operand has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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-06-11 15:31:01,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:31:01,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 193 [2021-06-11 15:31:01,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:31:01,098 INFO L129 PetriNetUnfolder]: 112/306 cut-off events. [2021-06-11 15:31:01,098 INFO L130 PetriNetUnfolder]: For 1010/1162 co-relation queries the response was YES. [2021-06-11 15:31:01,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 306 events. 112/306 cut-off events. For 1010/1162 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1843 event pairs, 4 based on Foata normal form. 9/277 useless extension candidates. Maximal degree in co-relation 1202. Up to 96 conditions per place. [2021-06-11 15:31:01,101 INFO L132 encePairwiseOnDemand]: 185/193 looper letters, 9 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2021-06-11 15:31:01,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 362 flow [2021-06-11 15:31:01,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:31:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:31:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 730 transitions. [2021-06-11 15:31:01,104 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7564766839378239 [2021-06-11 15:31:01,104 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 730 transitions. [2021-06-11 15:31:01,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 730 transitions. [2021-06-11 15:31:01,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:31:01,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 730 transitions. [2021-06-11 15:31:01,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:31:01,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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-06-11 15:31:01,109 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 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-06-11 15:31:01,110 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 282 flow. Second operand 5 states and 730 transitions. [2021-06-11 15:31:01,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 362 flow [2021-06-11 15:31:01,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 296 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-06-11 15:31:01,121 INFO L241 Difference]: Finished difference. Result has 52 places, 49 transitions, 292 flow [2021-06-11 15:31:01,121 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2021-06-11 15:31:01,122 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2021-06-11 15:31:01,122 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:31:01,122 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 49 transitions, 292 flow [2021-06-11 15:31:01,122 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 49 transitions, 292 flow [2021-06-11 15:31:01,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 49 transitions, 292 flow [2021-06-11 15:31:01,148 INFO L129 PetriNetUnfolder]: 108/300 cut-off events. [2021-06-11 15:31:01,149 INFO L130 PetriNetUnfolder]: For 397/413 co-relation queries the response was YES. [2021-06-11 15:31:01,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1048 conditions, 300 events. 108/300 cut-off events. For 397/413 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1932 event pairs, 6 based on Foata normal form. 2/267 useless extension candidates. Maximal degree in co-relation 1029. Up to 96 conditions per place. [2021-06-11 15:31:01,152 INFO L151 LiptonReduction]: Number of co-enabled transitions 496 [2021-06-11 15:31:01,193 INFO L163 LiptonReduction]: Checked pairs total: 291 [2021-06-11 15:31:01,193 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:31:01,193 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-06-11 15:31:01,194 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 292 flow [2021-06-11 15:31:01,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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-06-11 15:31:01,194 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:31:01,194 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-06-11 15:31:01,194 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 15:31:01,194 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:31:01,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:31:01,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1456699907, now seen corresponding path program 2 times [2021-06-11 15:31:01,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:31:01,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471326012] [2021-06-11 15:31:01,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:31:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:31:01,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:01,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:31:01,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:01,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:01,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:01,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:31:01,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471326012] [2021-06-11 15:31:01,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:31:01,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:31:01,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120397019] [2021-06-11 15:31:01,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:31:01,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:31:01,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:31:01,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:31:01,303 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 193 [2021-06-11 15:31:01,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-06-11 15:31:01,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:31:01,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 193 [2021-06-11 15:31:01,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:31:01,350 INFO L129 PetriNetUnfolder]: 132/366 cut-off events. [2021-06-11 15:31:01,350 INFO L130 PetriNetUnfolder]: For 515/533 co-relation queries the response was YES. [2021-06-11 15:31:01,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1299 conditions, 366 events. 132/366 cut-off events. For 515/533 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 2355 event pairs, 5 based on Foata normal form. 3/325 useless extension candidates. Maximal degree in co-relation 1278. Up to 128 conditions per place. [2021-06-11 15:31:01,353 INFO L132 encePairwiseOnDemand]: 190/193 looper letters, 3 selfloop transitions, 1 changer transitions 9/49 dead transitions. [2021-06-11 15:31:01,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 304 flow [2021-06-11 15:31:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:31:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:31:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2021-06-11 15:31:01,355 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8160621761658031 [2021-06-11 15:31:01,355 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 630 transitions. [2021-06-11 15:31:01,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 630 transitions. [2021-06-11 15:31:01,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:31:01,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 630 transitions. [2021-06-11 15:31:01,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 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-06-11 15:31:01,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-06-11 15:31:01,358 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 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-06-11 15:31:01,358 INFO L185 Difference]: Start difference. First operand has 52 places, 49 transitions, 292 flow. Second operand 4 states and 630 transitions. [2021-06-11 15:31:01,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 304 flow [2021-06-11 15:31:01,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:31:01,370 INFO L241 Difference]: Finished difference. Result has 56 places, 40 transitions, 228 flow [2021-06-11 15:31:01,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2021-06-11 15:31:01,370 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2021-06-11 15:31:01,371 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:31:01,371 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 40 transitions, 228 flow [2021-06-11 15:31:01,371 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 40 transitions, 228 flow [2021-06-11 15:31:01,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 40 transitions, 228 flow [2021-06-11 15:31:01,387 INFO L129 PetriNetUnfolder]: 42/152 cut-off events. [2021-06-11 15:31:01,387 INFO L130 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2021-06-11 15:31:01,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 152 events. 42/152 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 857 event pairs, 7 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 507. Up to 44 conditions per place. [2021-06-11 15:31:01,389 INFO L151 LiptonReduction]: Number of co-enabled transitions 304 [2021-06-11 15:31:01,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:01,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:31:01,428 INFO L163 LiptonReduction]: Checked pairs total: 352 [2021-06-11 15:31:01,429 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:31:01,429 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58 [2021-06-11 15:31:01,429 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 226 flow [2021-06-11 15:31:01,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-06-11 15:31:01,430 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:31:01,430 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-06-11 15:31:01,430 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 15:31:01,430 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:31:01,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:31:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1699328079, now seen corresponding path program 3 times [2021-06-11 15:31:01,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:31:01,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553473702] [2021-06-11 15:31:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:31:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:31:01,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:01,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:31:01,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:01,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:01,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:01,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:31:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:31:01,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553473702] [2021-06-11 15:31:01,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:31:01,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:31:01,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261286574] [2021-06-11 15:31:01,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:31:01,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:31:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:31:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:31:01,519 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 194 [2021-06-11 15:31:01,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 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-06-11 15:31:01,519 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:31:01,519 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 194 [2021-06-11 15:31:01,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:31:01,559 INFO L129 PetriNetUnfolder]: 66/233 cut-off events. [2021-06-11 15:31:01,559 INFO L130 PetriNetUnfolder]: For 439/445 co-relation queries the response was YES. [2021-06-11 15:31:01,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 233 events. 66/233 cut-off events. For 439/445 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1438 event pairs, 7 based on Foata normal form. 3/208 useless extension candidates. Maximal degree in co-relation 834. Up to 68 conditions per place. [2021-06-11 15:31:01,561 INFO L132 encePairwiseOnDemand]: 191/194 looper letters, 4 selfloop transitions, 1 changer transitions 15/41 dead transitions. [2021-06-11 15:31:01,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 41 transitions, 259 flow [2021-06-11 15:31:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:31:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:31:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 628 transitions. [2021-06-11 15:31:01,563 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8092783505154639 [2021-06-11 15:31:01,563 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 628 transitions. [2021-06-11 15:31:01,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 628 transitions. [2021-06-11 15:31:01,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:31:01,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 628 transitions. [2021-06-11 15:31:01,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-06-11 15:31:01,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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-06-11 15:31:01,567 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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-06-11 15:31:01,567 INFO L185 Difference]: Start difference. First operand has 53 places, 39 transitions, 226 flow. Second operand 4 states and 628 transitions. [2021-06-11 15:31:01,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 41 transitions, 259 flow [2021-06-11 15:31:01,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 41 transitions, 250 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-06-11 15:31:01,572 INFO L241 Difference]: Finished difference. Result has 55 places, 26 transitions, 137 flow [2021-06-11 15:31:01,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=55, PETRI_TRANSITIONS=26} [2021-06-11 15:31:01,573 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2021-06-11 15:31:01,573 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:31:01,573 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 26 transitions, 137 flow [2021-06-11 15:31:01,573 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 26 transitions, 137 flow [2021-06-11 15:31:01,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 26 transitions, 137 flow [2021-06-11 15:31:01,580 INFO L129 PetriNetUnfolder]: 9/48 cut-off events. [2021-06-11 15:31:01,580 INFO L130 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2021-06-11 15:31:01,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 48 events. 9/48 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 116 event pairs, 2 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 136. Up to 15 conditions per place. [2021-06-11 15:31:01,581 INFO L151 LiptonReduction]: Number of co-enabled transitions 54 [2021-06-11 15:31:02,122 WARN L205 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 161 [2021-06-11 15:31:02,281 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-06-11 15:31:03,299 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 330 DAG size of output: 228 [2021-06-11 15:31:03,595 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-06-11 15:31:03,632 INFO L142 QuantifierPusher]: treesize reduction 84, result has 90.8 percent of original size [2021-06-11 15:31:03,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:31:03,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:31:03,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:31:03,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,656 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:31:03,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:31:03,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:31:03,662 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:31:03,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:31:03,666 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:31:03,667 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:31:03,668 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:31:03,668 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:31:03,669 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,670 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:31:03,670 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:31:03,671 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,671 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:31:03,672 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:31:03,672 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,675 INFO L147 QuantifierPusher]: treesize reduction 185, result has 40.1 percent of original size 124 [2021-06-11 15:31:03,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:31:03,678 INFO L142 QuantifierPusher]: treesize reduction 185, result has 55.3 percent of original size [2021-06-11 15:31:03,679 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 4, 3, 2, 1] term [2021-06-11 15:31:03,679 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:31:03,680 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,681 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 15:31:03,681 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:31:03,682 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,682 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2021-06-11 15:31:03,683 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:31:03,683 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,686 INFO L147 QuantifierPusher]: treesize reduction 404, result has 24.5 percent of original size 131 [2021-06-11 15:31:03,687 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:31:03,687 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:31:03,688 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,689 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:31:03,689 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:31:03,690 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,690 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:31:03,690 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:31:03,691 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,692 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:31:03,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:31:03,695 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:31:03,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:31:03,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:31:03,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,706 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:31:03,712 INFO L147 QuantifierPusher]: treesize reduction 1645, result has 10.2 percent of original size 186 [2021-06-11 15:31:03,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:31:03,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:31:03,744 INFO L163 LiptonReduction]: Checked pairs total: 56 [2021-06-11 15:31:03,744 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:31:03,744 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2171 [2021-06-11 15:31:03,744 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 24 transitions, 133 flow [2021-06-11 15:31:03,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 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-06-11 15:31:03,745 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:31:03,745 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-06-11 15:31:03,745 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:31:03,745 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:31:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:31:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1801412925, now seen corresponding path program 1 times [2021-06-11 15:31:03,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:31:03,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061238113] [2021-06-11 15:31:03,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:31:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:31:03,814 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:31:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:31:03,912 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:31:03,940 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:31:03,941 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:31:03,941 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 15:31:04,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:31:04 BasicIcfg [2021-06-11 15:31:04,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:31:04,034 INFO L168 Benchmark]: Toolchain (without parser) took 14593.05 ms. Allocated memory was 327.2 MB in the beginning and 606.1 MB in the end (delta: 278.9 MB). Free memory was 289.0 MB in the beginning and 542.3 MB in the end (delta: -253.3 MB). Peak memory consumption was 26.7 MB. Max. memory is 16.0 GB. [2021-06-11 15:31:04,034 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 327.2 MB. Free memory is still 307.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:31:04,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.54 ms. Allocated memory is still 327.2 MB. Free memory was 288.9 MB in the beginning and 284.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-06-11 15:31:04,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.97 ms. Allocated memory is still 327.2 MB. Free memory was 284.9 MB in the beginning and 282.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:31:04,035 INFO L168 Benchmark]: Boogie Preprocessor took 63.15 ms. Allocated memory is still 327.2 MB. Free memory was 282.8 MB in the beginning and 279.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 15:31:04,035 INFO L168 Benchmark]: RCFGBuilder took 2075.66 ms. Allocated memory is still 327.2 MB. Free memory was 279.6 MB in the beginning and 293.7 MB in the end (delta: -14.1 MB). Peak memory consumption was 149.7 MB. Max. memory is 16.0 GB. [2021-06-11 15:31:04,035 INFO L168 Benchmark]: TraceAbstraction took 11755.77 ms. Allocated memory was 327.2 MB in the beginning and 606.1 MB in the end (delta: 278.9 MB). Free memory was 293.7 MB in the beginning and 542.3 MB in the end (delta: -248.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 16.0 GB. [2021-06-11 15:31:04,039 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.55 ms. Allocated memory is still 327.2 MB. Free memory is still 307.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 610.54 ms. Allocated memory is still 327.2 MB. Free memory was 288.9 MB in the beginning and 284.9 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 79.97 ms. Allocated memory is still 327.2 MB. Free memory was 284.9 MB in the beginning and 282.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 63.15 ms. Allocated memory is still 327.2 MB. Free memory was 282.8 MB in the beginning and 279.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2075.66 ms. Allocated memory is still 327.2 MB. Free memory was 279.6 MB in the beginning and 293.7 MB in the end (delta: -14.1 MB). Peak memory consumption was 149.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11755.77 ms. Allocated memory was 327.2 MB in the beginning and 606.1 MB in the end (delta: 278.9 MB). Free memory was 293.7 MB in the beginning and 542.3 MB in the end (delta: -248.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6441.5ms, 106 PlacesBefore, 35 PlacesAfterwards, 98 TransitionsBefore, 26 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 4725 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2359, positive: 2193, positive conditional: 2193, positive unconditional: 0, negative: 166, negative conditional: 166, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2359, positive: 2193, positive conditional: 0, positive unconditional: 2193, negative: 166, negative conditional: 0, negative unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2359, positive: 2193, positive conditional: 0, positive unconditional: 2193, negative: 166, negative conditional: 0, negative unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1419, positive: 1362, positive conditional: 0, positive unconditional: 1362, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1419, positive: 1348, positive conditional: 0, positive unconditional: 1348, negative: 71, negative conditional: 0, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 865, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 830, negative conditional: 0, negative unconditional: 830, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2359, positive: 831, positive conditional: 0, positive unconditional: 831, negative: 109, negative conditional: 0, negative unconditional: 109, unknown: 1419, unknown conditional: 0, unknown unconditional: 1419] , Statistics on independence cache: Total cache size (in pairs): 1419, Positive cache size: 1362, Positive conditional cache size: 0, Positive unconditional cache size: 1362, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 213.7ms, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 306 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, positive: 92, positive conditional: 92, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, positive: 92, positive conditional: 1, positive unconditional: 91, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114, positive: 92, positive conditional: 1, positive unconditional: 91, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 205, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 202, negative conditional: 0, negative unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, positive: 74, positive conditional: 1, positive unconditional: 73, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 1444, Positive cache size: 1380, Positive conditional cache size: 0, Positive unconditional cache size: 1380, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.9ms, 33 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 163 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1449, Positive cache size: 1385, Positive conditional cache size: 0, Positive unconditional cache size: 1385, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.5ms, 34 PlacesBefore, 34 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 161 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, positive: 72, positive conditional: 72, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 85, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 85, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 85, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1450, Positive cache size: 1386, Positive conditional cache size: 0, Positive unconditional cache size: 1386, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.8ms, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 159 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1450, Positive cache size: 1386, Positive conditional cache size: 0, Positive unconditional cache size: 1386, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.9ms, 40 PlacesBefore, 40 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 179 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, positive: 42, positive conditional: 18, positive unconditional: 24, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 42, positive conditional: 18, positive unconditional: 24, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 40, positive conditional: 17, positive unconditional: 23, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1452, Positive cache size: 1388, Positive conditional cache size: 1, Positive unconditional cache size: 1387, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.0ms, 49 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 396 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 257 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 131, positive: 120, positive conditional: 64, positive unconditional: 56, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 131, positive: 120, positive conditional: 64, positive unconditional: 56, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 3, positive unconditional: 1, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 131, positive: 116, positive conditional: 61, positive unconditional: 55, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1456, Positive cache size: 1392, Positive conditional cache size: 4, Positive unconditional cache size: 1388, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.0ms, 55 PlacesBefore, 54 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 239 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, positive: 98, positive conditional: 98, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, positive: 98, positive conditional: 66, positive unconditional: 32, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 98, positive conditional: 66, positive unconditional: 32, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, positive: 98, positive conditional: 66, positive unconditional: 32, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1456, Positive cache size: 1392, Positive conditional cache size: 4, Positive unconditional cache size: 1388, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.2ms, 52 PlacesBefore, 52 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 291 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, positive: 91, positive conditional: 56, positive unconditional: 35, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, positive: 91, positive conditional: 56, positive unconditional: 35, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, positive: 91, positive conditional: 56, positive unconditional: 35, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1456, Positive cache size: 1392, Positive conditional cache size: 4, Positive unconditional cache size: 1388, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 57.7ms, 56 PlacesBefore, 53 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 352 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, positive: 230, positive conditional: 230, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 248, positive: 230, positive conditional: 163, positive unconditional: 67, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 248, positive: 230, positive conditional: 163, positive unconditional: 67, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 248, positive: 228, positive conditional: 163, positive unconditional: 65, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1459, Positive cache size: 1394, Positive conditional cache size: 4, Positive unconditional cache size: 1390, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2170.6ms, 55 PlacesBefore, 46 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 56 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, positive: 38, positive conditional: 16, positive unconditional: 22, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, positive: 38, positive conditional: 16, positive unconditional: 22, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, positive: 36, positive conditional: 15, positive unconditional: 21, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1461, Positive cache size: 1396, Positive conditional cache size: 5, Positive unconditional cache size: 1391, Negative cache size: 65, Negative conditional cache size: 0, Negative unconditional cache size: 65, Eliminated conditions: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L851] 0 pthread_t t0; [L852] FCALL, FORK 0 pthread_create(&t0, 0, P0, 0) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 0 pthread_t t1; [L854] FCALL, FORK 0 pthread_create(&t1, 0, P1, 0) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] 0 pthread_t t2; [L856] FCALL, FORK 0 pthread_create(&t2, 0, P2, 0) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 1 z = 1 [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L775] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L776] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L779] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L866] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11549.1ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 848.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6510.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 59 SDtfs, 32 SDslu, 23 SDs, 0 SdLazy, 148 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 197.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 161.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=8, InterpolantAutomatonStates: 46, 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: 39.5ms SsaConstructionTime, 596.3ms SatisfiabilityAnalysisTime, 570.2ms InterpolantComputationTime, 167 NumberOfCodeBlocks, 167 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...