/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe027_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:46:56,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:46:56,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:46:56,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:46:56,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:46:56,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:46:56,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:46:56,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:46:56,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:46:56,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:46:56,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:46:56,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:46:56,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:46:56,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:46:56,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:46:56,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:46:56,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:46:56,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:46:56,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:46:56,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:46:56,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:46:56,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:46:56,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:46:56,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:46:56,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:46:56,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:46:56,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:46:56,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:46:56,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:46:56,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:46:56,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:46:56,425 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:46:56,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:46:56,427 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:46:56,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:46:56,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:46:56,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:46:56,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:46:56,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:46:56,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:46:56,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:46:56,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:46:56,476 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:46:56,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:46:56,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:46:56,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:46:56,481 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:46:56,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:46:56,481 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:46:56,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:46:56,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:46:56,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:46:56,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:46:56,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:46:56,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:46:56,484 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:46:56,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:46:56,484 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:46:56,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:46:56,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:46:56,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:46:56,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:46:56,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:46:56,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:46:56,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:46:56,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:46:56,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:46:56,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:46:56,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:46:56,486 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:46:56,487 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:46:56,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:46:56,487 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:46:56,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:46:56,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:46:56,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:46:56,923 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:46:56,924 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:46:56,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.oepc.i [2021-03-26 00:46:57,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf26105de/5d3e65de634444deabfedfd36a62d80c/FLAG3bb44addf [2021-03-26 00:46:57,567 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:46:57,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.oepc.i [2021-03-26 00:46:57,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf26105de/5d3e65de634444deabfedfd36a62d80c/FLAG3bb44addf [2021-03-26 00:46:57,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf26105de/5d3e65de634444deabfedfd36a62d80c [2021-03-26 00:46:57,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:46:57,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:46:57,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:46:57,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:46:57,841 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:46:57,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:46:57" (1/1) ... [2021-03-26 00:46:57,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52324bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:57, skipping insertion in model container [2021-03-26 00:46:57,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:46:57" (1/1) ... [2021-03-26 00:46:57,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:46:57,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:46:58,075 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/safe027_power.oepc.i[995,1008] [2021-03-26 00:46:58,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:46:58,402 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:46:58,415 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/safe027_power.oepc.i[995,1008] [2021-03-26 00:46:58,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:46:58,570 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:46:58,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58 WrapperNode [2021-03-26 00:46:58,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:46:58,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:46:58,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:46:58,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:46:58,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (1/1) ... [2021-03-26 00:46:58,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (1/1) ... [2021-03-26 00:46:58,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:46:58,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:46:58,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:46:58,660 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:46:58,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (1/1) ... [2021-03-26 00:46:58,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (1/1) ... [2021-03-26 00:46:58,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (1/1) ... [2021-03-26 00:46:58,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (1/1) ... [2021-03-26 00:46:58,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (1/1) ... [2021-03-26 00:46:58,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (1/1) ... [2021-03-26 00:46:58,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (1/1) ... [2021-03-26 00:46:58,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:46:58,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:46:58,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:46:58,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:46:58,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:46:58,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 00:46:58,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:46:58,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:46:58,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:46:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:46:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:46:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:46:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:46:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:46:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:46:58,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:46:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:46:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:46:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:46:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:46:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:46:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:46:58,834 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:47:01,939 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:47:01,940 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-26 00:47:01,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:47:01 BoogieIcfgContainer [2021-03-26 00:47:01,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:47:01,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:47:01,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:47:01,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:47:01,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:46:57" (1/3) ... [2021-03-26 00:47:01,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b65973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:47:01, skipping insertion in model container [2021-03-26 00:47:01,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:46:58" (2/3) ... [2021-03-26 00:47:01,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b65973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:47:01, skipping insertion in model container [2021-03-26 00:47:01,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:47:01" (3/3) ... [2021-03-26 00:47:01,951 INFO L111 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2021-03-26 00:47:01,958 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:47:01,963 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 00:47:01,964 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:47:02,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,027 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,027 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,080 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,080 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,080 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,080 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,087 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,090 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,096 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,096 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,111 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,111 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:02,112 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:47:02,128 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 00:47:02,155 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:47:02,155 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:47:02,155 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:47:02,155 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:47:02,155 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:47:02,155 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:47:02,155 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:47:02,155 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:47:02,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-03-26 00:47:02,227 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-03-26 00:47:02,227 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:47:02,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2021-03-26 00:47:02,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2021-03-26 00:47:02,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 111 transitions, 234 flow [2021-03-26 00:47:02,242 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:02,253 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 111 transitions, 234 flow [2021-03-26 00:47:02,255 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 111 transitions, 234 flow [2021-03-26 00:47:02,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 111 transitions, 234 flow [2021-03-26 00:47:02,298 INFO L129 PetriNetUnfolder]: 1/111 cut-off events. [2021-03-26 00:47:02,298 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:47:02,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 1/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2021-03-26 00:47:02,303 INFO L142 LiptonReduction]: Number of co-enabled transitions 1358 [2021-03-26 00:47:09,173 WARN L205 SmtUtils]: Spent 2.90 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2021-03-26 00:47:10,856 WARN L205 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 361 DAG size of output: 361 [2021-03-26 00:47:14,956 WARN L205 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 566 DAG size of output: 532 [2021-03-26 00:47:16,716 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 528 [2021-03-26 00:47:16,940 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-26 00:47:17,487 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-26 00:47:17,663 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 00:47:25,356 INFO L154 LiptonReduction]: Checked pairs total: 1880 [2021-03-26 00:47:25,356 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-26 00:47:25,358 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23117 [2021-03-26 00:47:25,373 INFO L129 PetriNetUnfolder]: 1/44 cut-off events. [2021-03-26 00:47:25,373 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:47:25,373 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:25,374 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:25,374 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1666340029, now seen corresponding path program 1 times [2021-03-26 00:47:25,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:25,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790569331] [2021-03-26 00:47:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:25,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:25,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:25,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:25,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:25,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790569331] [2021-03-26 00:47:25,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:25,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:47:25,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923998383] [2021-03-26 00:47:25,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-03-26 00:47:25,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:25,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-03-26 00:47:25,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-03-26 00:47:25,578 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 197 [2021-03-26 00:47:25,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 2 states, 2 states have (on average 192.5) internal successors, (385), 2 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:25,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:25,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 197 [2021-03-26 00:47:25,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:25,593 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-26 00:47:25,593 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:47:25,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-03-26 00:47:25,594 INFO L132 encePairwiseOnDemand]: 196/197 looper letters, 0 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2021-03-26 00:47:25,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 43 transitions, 98 flow [2021-03-26 00:47:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-03-26 00:47:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-03-26 00:47:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 385 transitions. [2021-03-26 00:47:25,605 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9771573604060914 [2021-03-26 00:47:25,606 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 385 transitions. [2021-03-26 00:47:25,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 385 transitions. [2021-03-26 00:47:25,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:25,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 385 transitions. [2021-03-26 00:47:25,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 192.5) internal successors, (385), 2 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:25,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:25,618 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:25,620 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 2 states and 385 transitions. [2021-03-26 00:47:25,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 43 transitions, 98 flow [2021-03-26 00:47:25,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 43 transitions, 94 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:47:25,623 INFO L241 Difference]: Finished difference. Result has 53 places, 43 transitions, 94 flow [2021-03-26 00:47:25,625 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2021-03-26 00:47:25,625 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 00:47:25,626 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:25,626 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 94 flow [2021-03-26 00:47:25,626 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 94 flow [2021-03-26 00:47:25,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 94 flow [2021-03-26 00:47:25,632 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-26 00:47:25,632 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:47:25,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2021-03-26 00:47:25,633 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 00:47:26,172 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-26 00:47:26,299 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-26 00:47:32,347 INFO L154 LiptonReduction]: Checked pairs total: 999 [2021-03-26 00:47:32,347 INFO L156 LiptonReduction]: Total number of compositions: 17 [2021-03-26 00:47:32,347 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6721 [2021-03-26 00:47:32,350 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 60 flow [2021-03-26 00:47:32,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 192.5) internal successors, (385), 2 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:32,350 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:32,351 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:32,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:47:32,351 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:32,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:32,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1666005601, now seen corresponding path program 1 times [2021-03-26 00:47:32,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:32,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736498508] [2021-03-26 00:47:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:32,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:32,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:32,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:32,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:32,573 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:47:32,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:47:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:32,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736498508] [2021-03-26 00:47:32,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:32,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:47:32,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001781086] [2021-03-26 00:47:32,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:47:32,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:32,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:47:32,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:47:32,583 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 214 [2021-03-26 00:47:32,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:32,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:32,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 214 [2021-03-26 00:47:32,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:32,610 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-26 00:47:32,611 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:47:32,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:47:32,611 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 1 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-03-26 00:47:32,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 66 flow [2021-03-26 00:47:32,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:47:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:47:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions. [2021-03-26 00:47:32,619 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9174454828660437 [2021-03-26 00:47:32,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 589 transitions. [2021-03-26 00:47:32,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 589 transitions. [2021-03-26 00:47:32,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:32,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 589 transitions. [2021-03-26 00:47:32,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:32,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:32,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:32,624 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 60 flow. Second operand 3 states and 589 transitions. [2021-03-26 00:47:32,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 66 flow [2021-03-26 00:47:32,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 66 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:47:32,625 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 68 flow [2021-03-26 00:47:32,625 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2021-03-26 00:47:32,626 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -19 predicate places. [2021-03-26 00:47:32,626 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:32,626 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 68 flow [2021-03-26 00:47:32,626 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 68 flow [2021-03-26 00:47:32,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 68 flow [2021-03-26 00:47:32,636 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-26 00:47:32,637 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:47:32,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 26 events. 0/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:47:32,637 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-26 00:47:33,106 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 00:47:33,439 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:47:33,573 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:47:33,697 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:47:33,824 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:47:33,948 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:47:33,951 INFO L154 LiptonReduction]: Checked pairs total: 648 [2021-03-26 00:47:33,952 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:47:33,952 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1326 [2021-03-26 00:47:33,953 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 62 flow [2021-03-26 00:47:33,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 195.75) internal successors, (783), 4 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:33,953 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:33,954 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:33,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:47:33,954 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:33,954 INFO L82 PathProgramCache]: Analyzing trace with hash 153885942, now seen corresponding path program 1 times [2021-03-26 00:47:33,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:33,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150531765] [2021-03-26 00:47:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:34,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:34,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:34,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:34,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:47:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:34,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150531765] [2021-03-26 00:47:34,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:34,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:47:34,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340924142] [2021-03-26 00:47:34,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:47:34,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:34,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:47:34,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:47:34,046 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 217 [2021-03-26 00:47:34,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:34,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:34,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 217 [2021-03-26 00:47:34,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:34,073 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:47:34,073 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:47:34,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 23 events. 0/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:47:34,074 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 1 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-03-26 00:47:34,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 23 transitions, 70 flow [2021-03-26 00:47:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:47:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:47:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 793 transitions. [2021-03-26 00:47:34,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.913594470046083 [2021-03-26 00:47:34,077 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 793 transitions. [2021-03-26 00:47:34,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 793 transitions. [2021-03-26 00:47:34,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:34,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 793 transitions. [2021-03-26 00:47:34,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 198.25) internal successors, (793), 4 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:34,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:34,084 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:34,084 INFO L185 Difference]: Start difference. First operand has 35 places, 23 transitions, 62 flow. Second operand 4 states and 793 transitions. [2021-03-26 00:47:34,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 23 transitions, 70 flow [2021-03-26 00:47:34,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 23 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:47:34,085 INFO L241 Difference]: Finished difference. Result has 37 places, 23 transitions, 68 flow [2021-03-26 00:47:34,085 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2021-03-26 00:47:34,085 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -20 predicate places. [2021-03-26 00:47:34,085 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:34,086 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 23 transitions, 68 flow [2021-03-26 00:47:34,086 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 68 flow [2021-03-26 00:47:34,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 68 flow [2021-03-26 00:47:34,091 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:47:34,091 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 00:47:34,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 23 events. 0/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:47:34,091 INFO L142 LiptonReduction]: Number of co-enabled transitions 216 [2021-03-26 00:47:34,792 WARN L205 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 169 [2021-03-26 00:47:35,110 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-26 00:47:35,703 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 169 [2021-03-26 00:47:36,008 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-26 00:47:36,011 INFO L154 LiptonReduction]: Checked pairs total: 398 [2021-03-26 00:47:36,011 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:47:36,011 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1926 [2021-03-26 00:47:36,012 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 64 flow [2021-03-26 00:47:36,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:36,013 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:36,013 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:36,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:47:36,013 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:36,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash -375359786, now seen corresponding path program 1 times [2021-03-26 00:47:36,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:36,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228252682] [2021-03-26 00:47:36,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:36,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:36,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:36,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:36,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:36,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:36,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:47:36,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:36,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:47:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:36,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228252682] [2021-03-26 00:47:36,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:36,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:47:36,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814712102] [2021-03-26 00:47:36,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:47:36,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:36,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:47:36,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:47:36,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 218 [2021-03-26 00:47:36,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:36,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:36,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 218 [2021-03-26 00:47:36,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:36,208 INFO L129 PetriNetUnfolder]: 5/42 cut-off events. [2021-03-26 00:47:36,208 INFO L130 PetriNetUnfolder]: For 18/42 co-relation queries the response was YES. [2021-03-26 00:47:36,209 INFO L84 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 42 events. 5/42 cut-off events. For 18/42 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 122 event pairs, 1 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 72. Up to 7 conditions per place. [2021-03-26 00:47:36,209 INFO L132 encePairwiseOnDemand]: 214/218 looper letters, 4 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2021-03-26 00:47:36,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 25 transitions, 87 flow [2021-03-26 00:47:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:47:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:47:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 778 transitions. [2021-03-26 00:47:36,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8922018348623854 [2021-03-26 00:47:36,212 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 778 transitions. [2021-03-26 00:47:36,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 778 transitions. [2021-03-26 00:47:36,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:36,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 778 transitions. [2021-03-26 00:47:36,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:36,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:36,216 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:36,216 INFO L185 Difference]: Start difference. First operand has 35 places, 22 transitions, 64 flow. Second operand 4 states and 778 transitions. [2021-03-26 00:47:36,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 25 transitions, 87 flow [2021-03-26 00:47:36,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 83 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:47:36,218 INFO L241 Difference]: Finished difference. Result has 38 places, 22 transitions, 74 flow [2021-03-26 00:47:36,218 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2021-03-26 00:47:36,218 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -19 predicate places. [2021-03-26 00:47:36,218 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:36,218 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 22 transitions, 74 flow [2021-03-26 00:47:36,219 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 22 transitions, 74 flow [2021-03-26 00:47:36,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 22 transitions, 74 flow [2021-03-26 00:47:36,227 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 00:47:36,227 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-26 00:47:36,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 22 events. 0/22 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:47:36,227 INFO L142 LiptonReduction]: Number of co-enabled transitions 208 [2021-03-26 00:47:36,447 INFO L154 LiptonReduction]: Checked pairs total: 180 [2021-03-26 00:47:36,447 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:36,447 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 229 [2021-03-26 00:47:36,448 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 74 flow [2021-03-26 00:47:36,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 192.8) internal successors, (964), 5 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:36,449 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:36,449 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:36,449 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:47:36,449 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1250326543, now seen corresponding path program 1 times [2021-03-26 00:47:36,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:36,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192371428] [2021-03-26 00:47:36,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:36,710 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.4 percent of original size [2021-03-26 00:47:36,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-03-26 00:47:36,751 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.5 percent of original size [2021-03-26 00:47:36,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-03-26 00:47:36,788 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.5 percent of original size [2021-03-26 00:47:36,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-03-26 00:47:36,803 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.3 percent of original size [2021-03-26 00:47:36,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-26 00:47:36,846 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-26 00:47:36,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 00:47:36,879 INFO L142 QuantifierPusher]: treesize reduction 2, result has 92.3 percent of original size [2021-03-26 00:47:36,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 00:47:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:36,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192371428] [2021-03-26 00:47:36,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:36,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:47:36,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856987616] [2021-03-26 00:47:36,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:47:36,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:36,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:47:36,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:47:36,897 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 218 [2021-03-26 00:47:36,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 74 flow. Second operand has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:36,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:36,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 218 [2021-03-26 00:47:36,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:37,082 INFO L129 PetriNetUnfolder]: 47/137 cut-off events. [2021-03-26 00:47:37,082 INFO L130 PetriNetUnfolder]: For 66/70 co-relation queries the response was YES. [2021-03-26 00:47:37,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 137 events. 47/137 cut-off events. For 66/70 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 611 event pairs, 7 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 292. Up to 55 conditions per place. [2021-03-26 00:47:37,086 INFO L132 encePairwiseOnDemand]: 213/218 looper letters, 15 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2021-03-26 00:47:37,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 143 flow [2021-03-26 00:47:37,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:47:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:47:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2021-03-26 00:47:37,089 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6158256880733946 [2021-03-26 00:47:37,090 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2021-03-26 00:47:37,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2021-03-26 00:47:37,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:37,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2021-03-26 00:47:37,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,093 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,093 INFO L185 Difference]: Start difference. First operand has 38 places, 22 transitions, 74 flow. Second operand 4 states and 537 transitions. [2021-03-26 00:47:37,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 143 flow [2021-03-26 00:47:37,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 127 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-26 00:47:37,096 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 92 flow [2021-03-26 00:47:37,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2021-03-26 00:47:37,097 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -18 predicate places. [2021-03-26 00:47:37,097 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:37,097 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 92 flow [2021-03-26 00:47:37,097 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 92 flow [2021-03-26 00:47:37,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 25 transitions, 92 flow [2021-03-26 00:47:37,108 INFO L129 PetriNetUnfolder]: 2/44 cut-off events. [2021-03-26 00:47:37,109 INFO L130 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2021-03-26 00:47:37,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 44 events. 2/44 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 1/45 useless extension candidates. Maximal degree in co-relation 81. Up to 6 conditions per place. [2021-03-26 00:47:37,109 INFO L142 LiptonReduction]: Number of co-enabled transitions 236 [2021-03-26 00:47:37,162 INFO L154 LiptonReduction]: Checked pairs total: 197 [2021-03-26 00:47:37,162 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:37,162 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-03-26 00:47:37,163 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 92 flow [2021-03-26 00:47:37,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,164 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:37,164 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:37,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:47:37,164 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:37,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:37,164 INFO L82 PathProgramCache]: Analyzing trace with hash 380816865, now seen corresponding path program 2 times [2021-03-26 00:47:37,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:37,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967741441] [2021-03-26 00:47:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:37,304 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-26 00:47:37,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 00:47:37,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:37,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 00:47:37,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:37,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 00:47:37,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:37,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 00:47:37,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:37,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 00:47:37,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:37,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:47:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:37,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967741441] [2021-03-26 00:47:37,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:37,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:47:37,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522063892] [2021-03-26 00:47:37,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:47:37,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:47:37,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:47:37,412 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 218 [2021-03-26 00:47:37,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 92 flow. Second operand has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:37,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 218 [2021-03-26 00:47:37,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:37,575 INFO L129 PetriNetUnfolder]: 44/123 cut-off events. [2021-03-26 00:47:37,575 INFO L130 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2021-03-26 00:47:37,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 123 events. 44/123 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 469 event pairs, 12 based on Foata normal form. 2/122 useless extension candidates. Maximal degree in co-relation 313. Up to 53 conditions per place. [2021-03-26 00:47:37,577 INFO L132 encePairwiseOnDemand]: 214/218 looper letters, 15 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2021-03-26 00:47:37,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 149 flow [2021-03-26 00:47:37,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:47:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:47:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2021-03-26 00:47:37,579 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6513761467889908 [2021-03-26 00:47:37,579 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2021-03-26 00:47:37,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2021-03-26 00:47:37,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:37,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2021-03-26 00:47:37,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,582 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,582 INFO L185 Difference]: Start difference. First operand has 39 places, 25 transitions, 92 flow. Second operand 4 states and 568 transitions. [2021-03-26 00:47:37,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 149 flow [2021-03-26 00:47:37,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:47:37,584 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 108 flow [2021-03-26 00:47:37,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2021-03-26 00:47:37,584 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -15 predicate places. [2021-03-26 00:47:37,584 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:37,585 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 26 transitions, 108 flow [2021-03-26 00:47:37,585 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 26 transitions, 108 flow [2021-03-26 00:47:37,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 26 transitions, 108 flow [2021-03-26 00:47:37,592 INFO L129 PetriNetUnfolder]: 2/43 cut-off events. [2021-03-26 00:47:37,592 INFO L130 PetriNetUnfolder]: For 22/24 co-relation queries the response was YES. [2021-03-26 00:47:37,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 43 events. 2/43 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 128 event pairs, 0 based on Foata normal form. 2/45 useless extension candidates. Maximal degree in co-relation 82. Up to 6 conditions per place. [2021-03-26 00:47:37,593 INFO L142 LiptonReduction]: Number of co-enabled transitions 248 [2021-03-26 00:47:37,665 INFO L154 LiptonReduction]: Checked pairs total: 215 [2021-03-26 00:47:37,666 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:37,666 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 82 [2021-03-26 00:47:37,670 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 108 flow [2021-03-26 00:47:37,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 138.0) internal successors, (966), 7 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,671 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:37,671 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:37,671 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:47:37,671 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:37,672 INFO L82 PathProgramCache]: Analyzing trace with hash 314057530, now seen corresponding path program 1 times [2021-03-26 00:47:37,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:37,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326927507] [2021-03-26 00:47:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:37,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:37,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:37,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:37,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:47:37,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:37,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:37,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326927507] [2021-03-26 00:47:37,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:37,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:47:37,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069199662] [2021-03-26 00:47:37,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:47:37,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:37,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:47:37,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:47:37,801 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 218 [2021-03-26 00:47:37,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:37,802 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 218 [2021-03-26 00:47:37,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:37,873 INFO L129 PetriNetUnfolder]: 142/291 cut-off events. [2021-03-26 00:47:37,873 INFO L130 PetriNetUnfolder]: For 108/115 co-relation queries the response was YES. [2021-03-26 00:47:37,875 INFO L84 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 291 events. 142/291 cut-off events. For 108/115 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1489 event pairs, 68 based on Foata normal form. 29/299 useless extension candidates. Maximal degree in co-relation 632. Up to 193 conditions per place. [2021-03-26 00:47:37,876 INFO L132 encePairwiseOnDemand]: 211/218 looper letters, 10 selfloop transitions, 10 changer transitions 0/39 dead transitions. [2021-03-26 00:47:37,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 174 flow [2021-03-26 00:47:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:47:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:47:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 972 transitions. [2021-03-26 00:47:37,880 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8917431192660551 [2021-03-26 00:47:37,880 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 972 transitions. [2021-03-26 00:47:37,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 972 transitions. [2021-03-26 00:47:37,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:37,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 972 transitions. [2021-03-26 00:47:37,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.4) internal successors, (972), 5 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,884 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:37,884 INFO L185 Difference]: Start difference. First operand has 42 places, 26 transitions, 108 flow. Second operand 5 states and 972 transitions. [2021-03-26 00:47:37,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 174 flow [2021-03-26 00:47:37,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:47:37,889 INFO L241 Difference]: Finished difference. Result has 48 places, 35 transitions, 179 flow [2021-03-26 00:47:37,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2021-03-26 00:47:37,889 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2021-03-26 00:47:37,889 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:37,890 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 35 transitions, 179 flow [2021-03-26 00:47:37,890 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 35 transitions, 179 flow [2021-03-26 00:47:37,890 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 35 transitions, 179 flow [2021-03-26 00:47:37,929 INFO L129 PetriNetUnfolder]: 142/291 cut-off events. [2021-03-26 00:47:37,929 INFO L130 PetriNetUnfolder]: For 271/285 co-relation queries the response was YES. [2021-03-26 00:47:37,930 INFO L84 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 291 events. 142/291 cut-off events. For 271/285 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1496 event pairs, 68 based on Foata normal form. 1/274 useless extension candidates. Maximal degree in co-relation 849. Up to 213 conditions per place. [2021-03-26 00:47:37,933 INFO L142 LiptonReduction]: Number of co-enabled transitions 368 [2021-03-26 00:47:38,073 INFO L154 LiptonReduction]: Checked pairs total: 461 [2021-03-26 00:47:38,073 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:47:38,073 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 184 [2021-03-26 00:47:38,074 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 173 flow [2021-03-26 00:47:38,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:38,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:38,074 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:38,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:47:38,074 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:38,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1529486007, now seen corresponding path program 1 times [2021-03-26 00:47:38,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:38,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190611159] [2021-03-26 00:47:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:38,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:38,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:38,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:38,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:38,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:38,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:47:38,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:38,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:38,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190611159] [2021-03-26 00:47:38,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:38,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:47:38,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459488933] [2021-03-26 00:47:38,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:47:38,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:38,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:47:38,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:47:38,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 218 [2021-03-26 00:47:38,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:38,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:38,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 218 [2021-03-26 00:47:38,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:38,261 INFO L129 PetriNetUnfolder]: 98/225 cut-off events. [2021-03-26 00:47:38,261 INFO L130 PetriNetUnfolder]: For 253/331 co-relation queries the response was YES. [2021-03-26 00:47:38,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 846 conditions, 225 events. 98/225 cut-off events. For 253/331 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1076 event pairs, 18 based on Foata normal form. 42/254 useless extension candidates. Maximal degree in co-relation 827. Up to 167 conditions per place. [2021-03-26 00:47:38,264 INFO L132 encePairwiseOnDemand]: 211/218 looper letters, 10 selfloop transitions, 14 changer transitions 0/43 dead transitions. [2021-03-26 00:47:38,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 273 flow [2021-03-26 00:47:38,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:47:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:47:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2021-03-26 00:47:38,268 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8914373088685015 [2021-03-26 00:47:38,268 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1166 transitions. [2021-03-26 00:47:38,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1166 transitions. [2021-03-26 00:47:38,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:38,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1166 transitions. [2021-03-26 00:47:38,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:38,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:38,273 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:38,273 INFO L185 Difference]: Start difference. First operand has 48 places, 34 transitions, 173 flow. Second operand 6 states and 1166 transitions. [2021-03-26 00:47:38,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 273 flow [2021-03-26 00:47:38,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 266 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:47:38,277 INFO L241 Difference]: Finished difference. Result has 52 places, 39 transitions, 262 flow [2021-03-26 00:47:38,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2021-03-26 00:47:38,277 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2021-03-26 00:47:38,277 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:38,277 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 39 transitions, 262 flow [2021-03-26 00:47:38,278 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 39 transitions, 262 flow [2021-03-26 00:47:38,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 39 transitions, 262 flow [2021-03-26 00:47:38,304 INFO L129 PetriNetUnfolder]: 98/225 cut-off events. [2021-03-26 00:47:38,304 INFO L130 PetriNetUnfolder]: For 482/531 co-relation queries the response was YES. [2021-03-26 00:47:38,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 225 events. 98/225 cut-off events. For 482/531 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1097 event pairs, 18 based on Foata normal form. 6/220 useless extension candidates. Maximal degree in co-relation 959. Up to 167 conditions per place. [2021-03-26 00:47:38,307 INFO L142 LiptonReduction]: Number of co-enabled transitions 422 [2021-03-26 00:47:41,531 INFO L154 LiptonReduction]: Checked pairs total: 464 [2021-03-26 00:47:41,531 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:47:41,532 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3255 [2021-03-26 00:47:41,532 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 254 flow [2021-03-26 00:47:41,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:41,533 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:41,533 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:41,533 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:47:41,533 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1489537367, now seen corresponding path program 1 times [2021-03-26 00:47:41,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:41,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541395124] [2021-03-26 00:47:41,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:41,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:41,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:41,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:41,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:41,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:41,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:41,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541395124] [2021-03-26 00:47:41,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:41,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:47:41,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573514913] [2021-03-26 00:47:41,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:47:41,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:41,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:47:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:47:41,597 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 218 [2021-03-26 00:47:41,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 193.25) internal successors, (773), 4 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:41,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:41,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 218 [2021-03-26 00:47:41,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:41,664 INFO L129 PetriNetUnfolder]: 148/336 cut-off events. [2021-03-26 00:47:41,665 INFO L130 PetriNetUnfolder]: For 908/1084 co-relation queries the response was YES. [2021-03-26 00:47:41,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 336 events. 148/336 cut-off events. For 908/1084 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1729 event pairs, 35 based on Foata normal form. 24/338 useless extension candidates. Maximal degree in co-relation 1426. Up to 239 conditions per place. [2021-03-26 00:47:41,668 INFO L132 encePairwiseOnDemand]: 215/218 looper letters, 5 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2021-03-26 00:47:41,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 234 flow [2021-03-26 00:47:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:47:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:47:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 776 transitions. [2021-03-26 00:47:41,672 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8899082568807339 [2021-03-26 00:47:41,672 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 776 transitions. [2021-03-26 00:47:41,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 776 transitions. [2021-03-26 00:47:41,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:41,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 776 transitions. [2021-03-26 00:47:41,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:41,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:41,676 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:41,676 INFO L185 Difference]: Start difference. First operand has 52 places, 38 transitions, 254 flow. Second operand 4 states and 776 transitions. [2021-03-26 00:47:41,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 234 flow [2021-03-26 00:47:41,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 36 transitions, 196 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 00:47:41,683 INFO L241 Difference]: Finished difference. Result has 51 places, 35 transitions, 189 flow [2021-03-26 00:47:41,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2021-03-26 00:47:41,684 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -6 predicate places. [2021-03-26 00:47:41,684 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:41,684 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 35 transitions, 189 flow [2021-03-26 00:47:41,684 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 35 transitions, 189 flow [2021-03-26 00:47:41,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 35 transitions, 189 flow [2021-03-26 00:47:41,722 INFO L129 PetriNetUnfolder]: 146/337 cut-off events. [2021-03-26 00:47:41,722 INFO L130 PetriNetUnfolder]: For 529/578 co-relation queries the response was YES. [2021-03-26 00:47:41,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1099 conditions, 337 events. 146/337 cut-off events. For 529/578 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1838 event pairs, 35 based on Foata normal form. 9/332 useless extension candidates. Maximal degree in co-relation 1080. Up to 223 conditions per place. [2021-03-26 00:47:41,729 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-26 00:47:41,827 INFO L154 LiptonReduction]: Checked pairs total: 150 [2021-03-26 00:47:41,828 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:41,828 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 144 [2021-03-26 00:47:41,828 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 189 flow [2021-03-26 00:47:41,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 193.25) internal successors, (773), 4 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:41,829 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:41,829 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:41,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:47:41,829 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:41,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:41,830 INFO L82 PathProgramCache]: Analyzing trace with hash -141875597, now seen corresponding path program 2 times [2021-03-26 00:47:41,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:41,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066302496] [2021-03-26 00:47:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:41,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:41,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:41,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:41,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:41,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:41,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:41,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:41,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:47:41,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:41,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:41,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066302496] [2021-03-26 00:47:41,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:41,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:47:41,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64377796] [2021-03-26 00:47:41,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:47:41,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:47:41,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:47:41,902 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 218 [2021-03-26 00:47:41,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 190.83333333333334) internal successors, (1145), 6 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:41,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:41,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 218 [2021-03-26 00:47:41,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:41,998 INFO L129 PetriNetUnfolder]: 94/244 cut-off events. [2021-03-26 00:47:41,998 INFO L130 PetriNetUnfolder]: For 416/675 co-relation queries the response was YES. [2021-03-26 00:47:41,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 986 conditions, 244 events. 94/244 cut-off events. For 416/675 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1186 event pairs, 4 based on Foata normal form. 84/310 useless extension candidates. Maximal degree in co-relation 965. Up to 173 conditions per place. [2021-03-26 00:47:42,000 INFO L132 encePairwiseOnDemand]: 211/218 looper letters, 6 selfloop transitions, 18 changer transitions 4/48 dead transitions. [2021-03-26 00:47:42,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 347 flow [2021-03-26 00:47:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:47:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:47:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1360 transitions. [2021-03-26 00:47:42,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.891218872870249 [2021-03-26 00:47:42,004 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1360 transitions. [2021-03-26 00:47:42,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1360 transitions. [2021-03-26 00:47:42,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:42,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1360 transitions. [2021-03-26 00:47:42,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 194.28571428571428) internal successors, (1360), 7 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:42,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:42,009 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 218.0) internal successors, (1744), 8 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:42,009 INFO L185 Difference]: Start difference. First operand has 51 places, 35 transitions, 189 flow. Second operand 7 states and 1360 transitions. [2021-03-26 00:47:42,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 347 flow [2021-03-26 00:47:42,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:47:42,012 INFO L241 Difference]: Finished difference. Result has 59 places, 44 transitions, 326 flow [2021-03-26 00:47:42,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=326, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2021-03-26 00:47:42,012 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2021-03-26 00:47:42,012 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:42,013 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 44 transitions, 326 flow [2021-03-26 00:47:42,013 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 44 transitions, 326 flow [2021-03-26 00:47:42,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 44 transitions, 326 flow [2021-03-26 00:47:42,038 INFO L129 PetriNetUnfolder]: 95/259 cut-off events. [2021-03-26 00:47:42,038 INFO L130 PetriNetUnfolder]: For 675/739 co-relation queries the response was YES. [2021-03-26 00:47:42,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 259 events. 95/259 cut-off events. For 675/739 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1428 event pairs, 4 based on Foata normal form. 3/248 useless extension candidates. Maximal degree in co-relation 1117. Up to 181 conditions per place. [2021-03-26 00:47:42,041 INFO L142 LiptonReduction]: Number of co-enabled transitions 410 [2021-03-26 00:47:42,052 INFO L154 LiptonReduction]: Checked pairs total: 366 [2021-03-26 00:47:42,052 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:47:42,052 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-26 00:47:42,054 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 316 flow [2021-03-26 00:47:42,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 190.83333333333334) internal successors, (1145), 6 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:42,054 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:42,055 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:42,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:47:42,055 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1293589636, now seen corresponding path program 1 times [2021-03-26 00:47:42,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:42,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648040767] [2021-03-26 00:47:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:42,156 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.7 percent of original size [2021-03-26 00:47:42,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-26 00:47:42,193 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-26 00:47:42,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-03-26 00:47:42,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:42,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:42,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648040767] [2021-03-26 00:47:42,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:42,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:47:42,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195543333] [2021-03-26 00:47:42,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:47:42,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:42,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:47:42,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:47:42,242 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 218 [2021-03-26 00:47:42,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:42,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:42,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 218 [2021-03-26 00:47:42,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:42,445 INFO L129 PetriNetUnfolder]: 190/461 cut-off events. [2021-03-26 00:47:42,445 INFO L130 PetriNetUnfolder]: For 1343/1567 co-relation queries the response was YES. [2021-03-26 00:47:42,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 461 events. 190/461 cut-off events. For 1343/1567 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2565 event pairs, 26 based on Foata normal form. 14/434 useless extension candidates. Maximal degree in co-relation 1851. Up to 263 conditions per place. [2021-03-26 00:47:42,450 INFO L132 encePairwiseOnDemand]: 211/218 looper letters, 13 selfloop transitions, 10 changer transitions 2/50 dead transitions. [2021-03-26 00:47:42,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 50 transitions, 377 flow [2021-03-26 00:47:42,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:47:42,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:47:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 976 transitions. [2021-03-26 00:47:42,453 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.746177370030581 [2021-03-26 00:47:42,453 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 976 transitions. [2021-03-26 00:47:42,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 976 transitions. [2021-03-26 00:47:42,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:42,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 976 transitions. [2021-03-26 00:47:42,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.66666666666666) internal successors, (976), 6 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:42,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:42,458 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:42,459 INFO L185 Difference]: Start difference. First operand has 59 places, 43 transitions, 316 flow. Second operand 6 states and 976 transitions. [2021-03-26 00:47:42,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 50 transitions, 377 flow [2021-03-26 00:47:42,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 324 flow, removed 20 selfloop flow, removed 4 redundant places. [2021-03-26 00:47:42,466 INFO L241 Difference]: Finished difference. Result has 61 places, 45 transitions, 295 flow [2021-03-26 00:47:42,466 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2021-03-26 00:47:42,466 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2021-03-26 00:47:42,467 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:42,467 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 45 transitions, 295 flow [2021-03-26 00:47:42,467 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 45 transitions, 295 flow [2021-03-26 00:47:42,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 45 transitions, 295 flow [2021-03-26 00:47:42,511 INFO L129 PetriNetUnfolder]: 167/400 cut-off events. [2021-03-26 00:47:42,511 INFO L130 PetriNetUnfolder]: For 801/830 co-relation queries the response was YES. [2021-03-26 00:47:42,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 400 events. 167/400 cut-off events. For 801/830 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2315 event pairs, 16 based on Foata normal form. 5/376 useless extension candidates. Maximal degree in co-relation 1388. Up to 171 conditions per place. [2021-03-26 00:47:42,516 INFO L142 LiptonReduction]: Number of co-enabled transitions 408 [2021-03-26 00:47:43,350 WARN L205 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 194 [2021-03-26 00:47:43,692 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2021-03-26 00:47:45,145 WARN L205 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 318 DAG size of output: 273 [2021-03-26 00:47:45,859 WARN L205 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-26 00:47:45,866 INFO L154 LiptonReduction]: Checked pairs total: 22 [2021-03-26 00:47:45,866 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:47:45,866 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3399 [2021-03-26 00:47:45,867 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 297 flow [2021-03-26 00:47:45,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:45,867 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:45,867 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:45,867 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:47:45,867 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:45,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:45,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1959446130, now seen corresponding path program 2 times [2021-03-26 00:47:45,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:45,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119647013] [2021-03-26 00:47:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:45,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:45,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:45,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:45,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:45,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:45,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:45,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:45,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:45,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:45,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:47:45,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:45,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:45,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119647013] [2021-03-26 00:47:45,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:45,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:47:45,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613445270] [2021-03-26 00:47:45,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:47:45,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:45,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:47:45,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:47:45,973 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 219 [2021-03-26 00:47:45,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 297 flow. Second operand has 7 states, 7 states have (on average 191.85714285714286) internal successors, (1343), 7 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:45,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:45,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 219 [2021-03-26 00:47:45,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:46,097 INFO L129 PetriNetUnfolder]: 134/333 cut-off events. [2021-03-26 00:47:46,098 INFO L130 PetriNetUnfolder]: For 783/1107 co-relation queries the response was YES. [2021-03-26 00:47:46,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 333 events. 134/333 cut-off events. For 783/1107 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1770 event pairs, 4 based on Foata normal form. 137/438 useless extension candidates. Maximal degree in co-relation 1354. Up to 154 conditions per place. [2021-03-26 00:47:46,101 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 2 selfloop transitions, 18 changer transitions 5/49 dead transitions. [2021-03-26 00:47:46,101 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 49 transitions, 386 flow [2021-03-26 00:47:46,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:47:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:47:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1554 transitions. [2021-03-26 00:47:46,106 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.886986301369863 [2021-03-26 00:47:46,106 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1554 transitions. [2021-03-26 00:47:46,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1554 transitions. [2021-03-26 00:47:46,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:46,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1554 transitions. [2021-03-26 00:47:46,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 194.25) internal successors, (1554), 8 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:46,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:46,112 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:46,112 INFO L185 Difference]: Start difference. First operand has 61 places, 45 transitions, 297 flow. Second operand 8 states and 1554 transitions. [2021-03-26 00:47:46,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 49 transitions, 386 flow [2021-03-26 00:47:46,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 49 transitions, 340 flow, removed 14 selfloop flow, removed 5 redundant places. [2021-03-26 00:47:46,117 INFO L241 Difference]: Finished difference. Result has 66 places, 44 transitions, 306 flow [2021-03-26 00:47:46,117 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=306, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2021-03-26 00:47:46,117 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2021-03-26 00:47:46,117 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:46,117 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 44 transitions, 306 flow [2021-03-26 00:47:46,118 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 44 transitions, 306 flow [2021-03-26 00:47:46,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 44 transitions, 306 flow [2021-03-26 00:47:46,148 INFO L129 PetriNetUnfolder]: 117/305 cut-off events. [2021-03-26 00:47:46,148 INFO L130 PetriNetUnfolder]: For 753/855 co-relation queries the response was YES. [2021-03-26 00:47:46,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 305 events. 117/305 cut-off events. For 753/855 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1649 event pairs, 4 based on Foata normal form. 5/279 useless extension candidates. Maximal degree in co-relation 1204. Up to 133 conditions per place. [2021-03-26 00:47:46,153 INFO L142 LiptonReduction]: Number of co-enabled transitions 382 [2021-03-26 00:47:46,338 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2021-03-26 00:47:46,496 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2021-03-26 00:47:46,756 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-26 00:47:47,033 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 155 [2021-03-26 00:47:47,250 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2021-03-26 00:47:47,424 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2021-03-26 00:47:47,709 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-26 00:47:47,987 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-26 00:47:47,996 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 00:47:47,996 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:47:47,997 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1880 [2021-03-26 00:47:47,997 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 290 flow [2021-03-26 00:47:47,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 191.85714285714286) internal successors, (1343), 7 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:47,998 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:47,998 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:47,998 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:47:47,998 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:47,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash -852995081, now seen corresponding path program 1 times [2021-03-26 00:47:47,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:47,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793917274] [2021-03-26 00:47:47,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:48,087 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.0 percent of original size [2021-03-26 00:47:48,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-03-26 00:47:48,137 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.3 percent of original size [2021-03-26 00:47:48,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-03-26 00:47:48,192 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-26 00:47:48,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-03-26 00:47:48,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:48,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:48,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793917274] [2021-03-26 00:47:48,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:48,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:47:48,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131822385] [2021-03-26 00:47:48,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:47:48,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:48,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:47:48,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:47:48,243 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 221 [2021-03-26 00:47:48,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:48,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:48,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 221 [2021-03-26 00:47:48,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:48,512 INFO L129 PetriNetUnfolder]: 215/477 cut-off events. [2021-03-26 00:47:48,512 INFO L130 PetriNetUnfolder]: For 3420/3711 co-relation queries the response was YES. [2021-03-26 00:47:48,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 477 events. 215/477 cut-off events. For 3420/3711 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 2749 event pairs, 12 based on Foata normal form. 25/445 useless extension candidates. Maximal degree in co-relation 1907. Up to 193 conditions per place. [2021-03-26 00:47:48,517 INFO L132 encePairwiseOnDemand]: 215/221 looper letters, 10 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2021-03-26 00:47:48,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 44 transitions, 366 flow [2021-03-26 00:47:48,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:47:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:47:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 959 transitions. [2021-03-26 00:47:48,520 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7232277526395173 [2021-03-26 00:47:48,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 959 transitions. [2021-03-26 00:47:48,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 959 transitions. [2021-03-26 00:47:48,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:48,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 959 transitions. [2021-03-26 00:47:48,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.83333333333334) internal successors, (959), 6 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:48,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:48,539 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:48,540 INFO L185 Difference]: Start difference. First operand has 62 places, 41 transitions, 290 flow. Second operand 6 states and 959 transitions. [2021-03-26 00:47:48,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 44 transitions, 366 flow [2021-03-26 00:47:48,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 44 transitions, 299 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-03-26 00:47:48,548 INFO L241 Difference]: Finished difference. Result has 61 places, 44 transitions, 296 flow [2021-03-26 00:47:48,549 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2021-03-26 00:47:48,549 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2021-03-26 00:47:48,549 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:48,549 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 44 transitions, 296 flow [2021-03-26 00:47:48,549 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 44 transitions, 296 flow [2021-03-26 00:47:48,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 44 transitions, 296 flow [2021-03-26 00:47:48,588 INFO L129 PetriNetUnfolder]: 198/430 cut-off events. [2021-03-26 00:47:48,588 INFO L130 PetriNetUnfolder]: For 1580/1706 co-relation queries the response was YES. [2021-03-26 00:47:48,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 430 events. 198/430 cut-off events. For 1580/1706 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 2641 event pairs, 2 based on Foata normal form. 21/401 useless extension candidates. Maximal degree in co-relation 1263. Up to 141 conditions per place. [2021-03-26 00:47:48,594 INFO L142 LiptonReduction]: Number of co-enabled transitions 402 [2021-03-26 00:47:49,536 WARN L205 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 194 [2021-03-26 00:47:49,984 WARN L205 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2021-03-26 00:47:51,708 WARN L205 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 318 DAG size of output: 273 [2021-03-26 00:47:52,465 WARN L205 SmtUtils]: Spent 755.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-26 00:47:52,473 INFO L154 LiptonReduction]: Checked pairs total: 20 [2021-03-26 00:47:52,473 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:47:52,473 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3924 [2021-03-26 00:47:52,474 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 297 flow [2021-03-26 00:47:52,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:52,474 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:52,474 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:52,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:47:52,475 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash -870047577, now seen corresponding path program 1 times [2021-03-26 00:47:52,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:52,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731893219] [2021-03-26 00:47:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:52,567 INFO L142 QuantifierPusher]: treesize reduction 3, result has 96.7 percent of original size [2021-03-26 00:47:52,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2021-03-26 00:47:52,630 INFO L142 QuantifierPusher]: treesize reduction 3, result has 96.9 percent of original size [2021-03-26 00:47:52,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 95 [2021-03-26 00:47:52,698 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-26 00:47:52,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-03-26 00:47:52,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:52,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:52,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731893219] [2021-03-26 00:47:52,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:52,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:47:52,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015925939] [2021-03-26 00:47:52,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:47:52,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:52,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:47:52,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:47:52,752 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 222 [2021-03-26 00:47:52,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:52,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:52,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 222 [2021-03-26 00:47:52,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:52,994 INFO L129 PetriNetUnfolder]: 242/535 cut-off events. [2021-03-26 00:47:52,994 INFO L130 PetriNetUnfolder]: For 2453/2619 co-relation queries the response was YES. [2021-03-26 00:47:52,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 535 events. 242/535 cut-off events. For 2453/2619 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3236 event pairs, 10 based on Foata normal form. 25/500 useless extension candidates. Maximal degree in co-relation 1623. Up to 171 conditions per place. [2021-03-26 00:47:52,998 INFO L132 encePairwiseOnDemand]: 216/222 looper letters, 11 selfloop transitions, 10 changer transitions 2/47 dead transitions. [2021-03-26 00:47:52,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 47 transitions, 366 flow [2021-03-26 00:47:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:47:53,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:47:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 952 transitions. [2021-03-26 00:47:53,002 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7147147147147147 [2021-03-26 00:47:53,002 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 952 transitions. [2021-03-26 00:47:53,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 952 transitions. [2021-03-26 00:47:53,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:53,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 952 transitions. [2021-03-26 00:47:53,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:53,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:53,006 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:53,006 INFO L185 Difference]: Start difference. First operand has 61 places, 44 transitions, 297 flow. Second operand 6 states and 952 transitions. [2021-03-26 00:47:53,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 47 transitions, 366 flow [2021-03-26 00:47:53,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 47 transitions, 337 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 00:47:53,016 INFO L241 Difference]: Finished difference. Result has 65 places, 45 transitions, 310 flow [2021-03-26 00:47:53,016 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=65, PETRI_TRANSITIONS=45} [2021-03-26 00:47:53,016 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2021-03-26 00:47:53,016 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:53,016 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 45 transitions, 310 flow [2021-03-26 00:47:53,017 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 45 transitions, 310 flow [2021-03-26 00:47:53,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 45 transitions, 310 flow [2021-03-26 00:47:53,052 INFO L129 PetriNetUnfolder]: 199/428 cut-off events. [2021-03-26 00:47:53,052 INFO L130 PetriNetUnfolder]: For 1707/1842 co-relation queries the response was YES. [2021-03-26 00:47:53,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 428 events. 199/428 cut-off events. For 1707/1842 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2648 event pairs, 1 based on Foata normal form. 21/400 useless extension candidates. Maximal degree in co-relation 1280. Up to 143 conditions per place. [2021-03-26 00:47:53,057 INFO L142 LiptonReduction]: Number of co-enabled transitions 414 [2021-03-26 00:47:54,035 WARN L205 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 194 [2021-03-26 00:47:54,424 WARN L205 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2021-03-26 00:47:56,188 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 318 DAG size of output: 274 [2021-03-26 00:47:56,986 WARN L205 SmtUtils]: Spent 796.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2021-03-26 00:47:56,995 INFO L154 LiptonReduction]: Checked pairs total: 20 [2021-03-26 00:47:56,995 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:47:56,995 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3979 [2021-03-26 00:47:56,996 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 311 flow [2021-03-26 00:47:56,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:56,996 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:56,997 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:56,997 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:47:56,997 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:56,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1957789793, now seen corresponding path program 2 times [2021-03-26 00:47:56,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:56,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898282682] [2021-03-26 00:47:56,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:57,101 INFO L142 QuantifierPusher]: treesize reduction 32, result has 68.6 percent of original size [2021-03-26 00:47:57,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-03-26 00:47:57,185 INFO L142 QuantifierPusher]: treesize reduction 32, result has 70.6 percent of original size [2021-03-26 00:47:57,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-03-26 00:47:57,261 INFO L142 QuantifierPusher]: treesize reduction 39, result has 70.9 percent of original size [2021-03-26 00:47:57,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 95 [2021-03-26 00:47:57,339 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.1 percent of original size [2021-03-26 00:47:57,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-26 00:47:57,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:57,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:57,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898282682] [2021-03-26 00:47:57,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:57,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:47:57,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523880078] [2021-03-26 00:47:57,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:47:57,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:57,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:47:57,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:47:57,410 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 223 [2021-03-26 00:47:57,411 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 311 flow. Second operand has 7 states, 7 states have (on average 156.28571428571428) internal successors, (1094), 7 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:57,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:57,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 223 [2021-03-26 00:47:57,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:57,655 INFO L129 PetriNetUnfolder]: 228/510 cut-off events. [2021-03-26 00:47:57,656 INFO L130 PetriNetUnfolder]: For 2485/2633 co-relation queries the response was YES. [2021-03-26 00:47:57,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 510 events. 228/510 cut-off events. For 2485/2633 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3032 event pairs, 9 based on Foata normal form. 23/476 useless extension candidates. Maximal degree in co-relation 1562. Up to 164 conditions per place. [2021-03-26 00:47:57,659 INFO L132 encePairwiseOnDemand]: 216/223 looper letters, 8 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2021-03-26 00:47:57,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 45 transitions, 337 flow [2021-03-26 00:47:57,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:47:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:47:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 791 transitions. [2021-03-26 00:47:57,663 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7094170403587444 [2021-03-26 00:47:57,663 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 791 transitions. [2021-03-26 00:47:57,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 791 transitions. [2021-03-26 00:47:57,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:57,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 791 transitions. [2021-03-26 00:47:57,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.2) internal successors, (791), 5 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:57,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:57,667 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 223.0) internal successors, (1338), 6 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:57,667 INFO L185 Difference]: Start difference. First operand has 64 places, 45 transitions, 311 flow. Second operand 5 states and 791 transitions. [2021-03-26 00:47:57,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 45 transitions, 337 flow [2021-03-26 00:47:57,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 45 transitions, 312 flow, removed 2 selfloop flow, removed 7 redundant places. [2021-03-26 00:47:57,674 INFO L241 Difference]: Finished difference. Result has 62 places, 38 transitions, 240 flow [2021-03-26 00:47:57,674 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2021-03-26 00:47:57,674 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 5 predicate places. [2021-03-26 00:47:57,674 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:57,674 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 38 transitions, 240 flow [2021-03-26 00:47:57,674 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 38 transitions, 240 flow [2021-03-26 00:47:57,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 38 transitions, 240 flow [2021-03-26 00:47:57,694 INFO L129 PetriNetUnfolder]: 111/247 cut-off events. [2021-03-26 00:47:57,695 INFO L130 PetriNetUnfolder]: For 459/523 co-relation queries the response was YES. [2021-03-26 00:47:57,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 247 events. 111/247 cut-off events. For 459/523 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1282 event pairs, 0 based on Foata normal form. 5/219 useless extension candidates. Maximal degree in co-relation 734. Up to 80 conditions per place. [2021-03-26 00:47:57,698 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-26 00:47:58,610 WARN L205 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 194 [2021-03-26 00:47:59,421 WARN L205 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 191 [2021-03-26 00:48:01,408 WARN L205 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 318 DAG size of output: 274 [2021-03-26 00:48:02,190 WARN L205 SmtUtils]: Spent 780.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2021-03-26 00:48:02,195 INFO L154 LiptonReduction]: Checked pairs total: 16 [2021-03-26 00:48:02,195 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:48:02,195 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4521 [2021-03-26 00:48:02,196 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 238 flow [2021-03-26 00:48:02,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 156.28571428571428) internal successors, (1094), 7 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:02,196 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:02,196 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:02,196 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:48:02,197 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash 768373341, now seen corresponding path program 3 times [2021-03-26 00:48:02,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:02,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623779939] [2021-03-26 00:48:02,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:48:02,260 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:48:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:48:02,320 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:48:02,352 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:48:02,352 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:48:02,352 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:48:02,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:48:02 BasicIcfg [2021-03-26 00:48:02,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:48:02,481 INFO L168 Benchmark]: Toolchain (without parser) took 64647.86 ms. Allocated memory was 255.9 MB in the beginning and 734.0 MB in the end (delta: 478.2 MB). Free memory was 234.6 MB in the beginning and 385.5 MB in the end (delta: -150.8 MB). Peak memory consumption was 325.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:02,481 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:48:02,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.74 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.0 MB in the beginning and 293.5 MB in the end (delta: -59.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:02,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.34 ms. Allocated memory is still 335.5 MB. Free memory was 292.8 MB in the beginning and 290.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:02,482 INFO L168 Benchmark]: Boogie Preprocessor took 66.86 ms. Allocated memory is still 335.5 MB. Free memory was 290.7 MB in the beginning and 287.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:02,483 INFO L168 Benchmark]: RCFGBuilder took 3215.99 ms. Allocated memory was 335.5 MB in the beginning and 402.7 MB in the end (delta: 67.1 MB). Free memory was 287.9 MB in the beginning and 332.2 MB in the end (delta: -44.3 MB). Peak memory consumption was 173.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:02,483 INFO L168 Benchmark]: TraceAbstraction took 60535.20 ms. Allocated memory was 402.7 MB in the beginning and 734.0 MB in the end (delta: 331.4 MB). Free memory was 332.2 MB in the beginning and 385.5 MB in the end (delta: -53.3 MB). Peak memory consumption was 277.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:02,488 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.74 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 735.74 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.0 MB in the beginning and 293.5 MB in the end (delta: -59.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 85.34 ms. Allocated memory is still 335.5 MB. Free memory was 292.8 MB in the beginning and 290.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 66.86 ms. Allocated memory is still 335.5 MB. Free memory was 290.7 MB in the beginning and 287.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 3215.99 ms. Allocated memory was 335.5 MB in the beginning and 402.7 MB in the end (delta: 67.1 MB). Free memory was 287.9 MB in the beginning and 332.2 MB in the end (delta: -44.3 MB). Peak memory consumption was 173.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 60535.20 ms. Allocated memory was 402.7 MB in the beginning and 734.0 MB in the end (delta: 331.4 MB). Free memory was 332.2 MB in the beginning and 385.5 MB in the end (delta: -53.3 MB). Peak memory consumption was 277.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23101.0ms, 123 PlacesBefore, 57 PlacesAfterwards, 111 TransitionsBefore, 45 TransitionsAfterwards, 1358 CoEnabledTransitionPairs, 4 FixpointIterations, 40 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 68 TotalNumberOfCompositions, 1880 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1061, positive: 1013, positive conditional: 1013, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 873, positive: 837, positive conditional: 0, positive unconditional: 837, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 873, positive: 837, positive conditional: 0, positive unconditional: 837, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 873, positive: 827, positive conditional: 0, positive unconditional: 827, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9414, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 438, negative conditional: 0, negative unconditional: 438, unknown: 8950, unknown conditional: 0, unknown unconditional: 8950] ], Cache Queries: [ total: 1061, positive: 176, positive conditional: 176, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 873, unknown conditional: 873, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 47, Positive conditional cache size: 47, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6721.1ms, 53 PlacesBefore, 35 PlacesAfterwards, 43 TransitionsBefore, 26 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 15 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 999 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 340, positive: 269, positive conditional: 269, positive unconditional: 0, negative: 71, negative conditional: 71, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 91, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 91, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4906, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 202, negative conditional: 0, negative unconditional: 202, unknown: 4688, unknown conditional: 0, unknown unconditional: 4688] ], Cache Queries: [ total: 340, positive: 196, positive conditional: 196, positive unconditional: 0, negative: 53, negative conditional: 53, negative unconditional: 0, unknown: 91, unknown conditional: 91, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1325.7ms, 38 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 648 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 203, positive: 155, positive conditional: 155, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 20, negative conditional: 4, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, positive: 149, positive conditional: 149, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 91, Positive conditional cache size: 91, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1924.9ms, 37 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 398 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 154, positive: 124, positive conditional: 124, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 95, Positive conditional cache size: 95, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 228.4ms, 38 PlacesBefore, 38 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 180 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 217, negative conditional: 0, negative unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 99, Positive conditional cache size: 99, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.9ms, 39 PlacesBefore, 39 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 197 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 13, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 13, positive unconditional: 7, 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: 20, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 119, Positive conditional cache size: 119, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.8ms, 42 PlacesBefore, 42 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, 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: 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] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 183.1ms, 48 PlacesBefore, 48 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 461 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 157, positive: 135, positive conditional: 135, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 36, positive conditional: 20, positive unconditional: 16, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, positive: 36, positive conditional: 20, positive unconditional: 16, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 2, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 124, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 124, negative conditional: 68, negative unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 157, positive: 99, positive conditional: 99, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 42, unknown conditional: 42, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 135, Positive conditional cache size: 135, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3253.8ms, 52 PlacesBefore, 52 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 232, positive: 212, positive conditional: 212, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 58, positive conditional: 36, positive unconditional: 22, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 62, positive: 58, positive conditional: 36, positive unconditional: 22, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 62, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3212, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 3140, unknown conditional: 0, unknown unconditional: 3140] ], Cache Queries: [ total: 232, positive: 154, positive conditional: 154, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 179, Positive conditional cache size: 179, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 143.4ms, 51 PlacesBefore, 51 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 150 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 6, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 6, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 95, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 193, Positive conditional cache size: 193, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.1ms, 59 PlacesBefore, 59 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 366 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 191, Positive conditional cache size: 191, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3398.9ms, 61 PlacesBefore, 61 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, 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: 22, positive: 22, positive conditional: 0, positive unconditional: 22, 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: 22, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 183, Positive conditional cache size: 183, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1878.7ms, 66 PlacesBefore, 62 PlacesAfterwards, 44 TransitionsBefore, 41 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 146, Positive conditional cache size: 146, Positive unconditional cache size: 0, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3924.0ms, 61 PlacesBefore, 61 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 20 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 20, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 155, Positive conditional cache size: 155, Positive unconditional cache size: 0, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3978.8ms, 65 PlacesBefore, 64 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 20 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 20, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 161, Positive conditional cache size: 161, Positive unconditional cache size: 0, Negative cache size: 8, Negative conditional cache size: 8, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4520.6ms, 62 PlacesBefore, 61 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 16 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 104, Positive conditional cache size: 104, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_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$$choice1=0, weak$$choice2=0, x=0, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L866] 0 pthread_t t2418; [L867] FCALL, FORK 0 pthread_create(&t2418, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_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$$choice1=0, weak$$choice2=0, x=0, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L870] 0 pthread_t t2420; [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L774] EXPR 1 !y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))) [L774] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L775] EXPR 1 !y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))) [L775] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L776] EXPR 1 !y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0))) [L776] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] EXPR 1 !y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L777] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] EXPR 1 !y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L778] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] EXPR 1 !y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L779] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] EXPR 1 \read(y) [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L787] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L799] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L811] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] 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) [L818] EXPR 3 \read(y) [L818] 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) [L818] 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) [L819] 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)) [L819] EXPR 3 !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) [L819] 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)) [L819] 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)) [L820] 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)) [L820] EXPR 3 !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) [L820] 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)) [L820] 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)) [L821] 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)) [L821] EXPR 3 !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) [L821] 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)) [L821] 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)) [L822] 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)) [L822] EXPR 3 !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) [L822] 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)) [L822] 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)) [L823] 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)) [L823] EXPR 3 !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) [L823] 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)) [L823] 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)) [L824] 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)) [L824] EXPR 3 !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) [L824] 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)) [L824] 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)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] EXPR 3 \read(y) [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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$$choice1=0, weak$$choice2=0, x=1, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L871] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0: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$$choice1=0, weak$$choice2=0, x=1, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L839] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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$$choice1=0, weak$$choice2=0, x=1, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L843] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L845] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L846] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L877] 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) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] 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) [L877] 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) [L878] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] 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 [L880] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L881] 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 [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={9:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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$$choice1=255, weak$$choice2=0, x=1, y={9: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 8.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 60204.2ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2180.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 23208.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 58 SDtfs, 36 SDslu, 42 SDs, 0 SdLazy, 453 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 800.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1204.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=10, InterpolantAutomatonStates: 74, 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: 67.1ms SsaConstructionTime, 771.1ms SatisfiabilityAnalysisTime, 1952.4ms InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 3537 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...