/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:44:01,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:44:01,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:44:01,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:44:01,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:44:01,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:44:01,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:44:01,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:44:01,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:44:01,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:44:01,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:44:01,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:44:01,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:44:01,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:44:01,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:44:01,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:44:01,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:44:01,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:44:01,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:44:01,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:44:01,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:44:01,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:44:01,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:44:01,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:44:01,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:44:01,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:44:01,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:44:01,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:44:01,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:44:01,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:44:01,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:44:01,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:44:01,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:44:01,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:44:01,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:44:01,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:44:01,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:44:01,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:44:01,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:44:01,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:44:01,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:44:01,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 15:44:01,985 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:44:01,986 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:44:01,988 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:44:01,988 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:44:01,988 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:44:01,988 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:44:01,988 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:44:01,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:44:01,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:44:01,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:44:01,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:44:01,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:44:01,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:44:01,989 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:44:01,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:44:01,989 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:44:01,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:44:01,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:44:01,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:44:01,990 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:44:01,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:44:01,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:44:01,990 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:44:01,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:44:01,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:44:01,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:44:01,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:44:01,991 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:44:01,991 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:44:01,991 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:44:01,991 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 15:44:02,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:44:02,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:44:02,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:44:02,246 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:44:02,247 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:44:02,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i [2021-06-11 15:44:02,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74360c64a/521dee14a70844d2b8946e9b9f9eb3c8/FLAG22169c947 [2021-06-11 15:44:02,888 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:44:02,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i [2021-06-11 15:44:02,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74360c64a/521dee14a70844d2b8946e9b9f9eb3c8/FLAG22169c947 [2021-06-11 15:44:02,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74360c64a/521dee14a70844d2b8946e9b9f9eb3c8 [2021-06-11 15:44:02,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:44:02,917 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:44:02,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:44:02,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:44:02,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:44:02,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:44:02" (1/1) ... [2021-06-11 15:44:02,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d79520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:02, skipping insertion in model container [2021-06-11 15:44:02,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:44:02" (1/1) ... [2021-06-11 15:44:02,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:44:02,964 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:44:03,125 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/mix033_pso.oepc.i[949,962] [2021-06-11 15:44:03,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:44:03,292 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:44:03,300 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/mix033_pso.oepc.i[949,962] [2021-06-11 15:44:03,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:44:03,379 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:44:03,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03 WrapperNode [2021-06-11 15:44:03,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:44:03,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:44:03,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:44:03,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:44:03,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (1/1) ... [2021-06-11 15:44:03,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (1/1) ... [2021-06-11 15:44:03,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:44:03,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:44:03,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:44:03,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:44:03,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (1/1) ... [2021-06-11 15:44:03,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (1/1) ... [2021-06-11 15:44:03,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (1/1) ... [2021-06-11 15:44:03,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (1/1) ... [2021-06-11 15:44:03,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (1/1) ... [2021-06-11 15:44:03,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (1/1) ... [2021-06-11 15:44:03,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (1/1) ... [2021-06-11 15:44:03,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:44:03,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:44:03,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:44:03,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:44:03,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:44:03,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:44:03,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:44:03,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:44:03,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:44:03,583 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:44:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:44:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:44:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:44:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:44:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:44:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:44:03,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:44:03,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:44:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:44:03,592 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 15:44:04,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:44:04,925 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:44:04,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:44:04 BoogieIcfgContainer [2021-06-11 15:44:04,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:44:04,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:44:04,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:44:04,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:44:04,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:44:02" (1/3) ... [2021-06-11 15:44:04,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3b94b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:44:04, skipping insertion in model container [2021-06-11 15:44:04,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:44:03" (2/3) ... [2021-06-11 15:44:04,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3b94b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:44:04, skipping insertion in model container [2021-06-11 15:44:04,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:44:04" (3/3) ... [2021-06-11 15:44:04,931 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_pso.oepc.i [2021-06-11 15:44:04,935 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:44:04,938 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:44:04,938 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:44:04,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,963 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,963 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,963 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,963 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,963 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,966 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,966 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,968 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,969 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,975 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,981 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,981 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,981 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,982 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,983 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:44:04,988 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:44:04,999 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 15:44:05,011 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:44:05,012 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:44:05,012 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:44:05,012 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:44:05,012 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:44:05,012 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:44:05,012 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:44:05,012 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:44:05,018 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-06-11 15:44:05,042 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-06-11 15:44:05,042 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:05,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 79 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-06-11 15:44:05,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-06-11 15:44:05,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-06-11 15:44:05,049 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:05,057 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2021-06-11 15:44:05,059 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2021-06-11 15:44:05,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2021-06-11 15:44:05,072 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-06-11 15:44:05,073 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:05,073 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-06-11 15:44:05,075 INFO L151 LiptonReduction]: Number of co-enabled transitions 2054 [2021-06-11 15:44:05,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,163 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:05,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:05,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:05,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,449 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:05,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:05,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:05,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:05,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:05,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:05,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:05,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:05,980 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:44:05,980 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:44:05,999 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,182 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:44:06,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:06,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,773 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:06,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:06,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:06,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:06,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:07,003 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:44:07,405 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2021-06-11 15:44:07,542 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-11 15:44:07,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:07,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:44:07,556 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:07,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,557 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 15:44:07,557 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:44:07,560 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,561 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 15:44:07,561 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:07,563 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 15:44:07,564 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 15:44:07,564 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:44:07,565 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,567 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 15:44:07,567 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 15:44:07,567 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:44:07,568 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,572 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 15:44:07,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:07,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,863 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:07,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:07,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:07,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:07,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:08,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:08,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:08,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:08,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:08,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:08,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:08,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,260 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:44:08,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:08,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:08,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:08,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:08,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:08,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:08,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:09,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:09,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:09,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:09,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:09,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,309 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:09,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:44:09,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:09,311 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:09,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,312 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:09,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:44:09,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:44:09,313 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:09,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:44:09,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:44:09,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,558 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:09,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:09,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:09,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:09,924 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:44:10,098 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:44:10,445 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 15:44:10,609 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 15:44:10,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:44:10,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:10,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:44:10,644 INFO L163 LiptonReduction]: Checked pairs total: 6119 [2021-06-11 15:44:10,644 INFO L165 LiptonReduction]: Total number of compositions: 96 [2021-06-11 15:44:10,646 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5598 [2021-06-11 15:44:10,651 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-06-11 15:44:10,651 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:10,651 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:10,652 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-11 15:44:10,652 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:10,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:10,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1094106, now seen corresponding path program 1 times [2021-06-11 15:44:10,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:10,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046610192] [2021-06-11 15:44:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:10,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:10,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:10,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046610192] [2021-06-11 15:44:10,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:10,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:44:10,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775598135] [2021-06-11 15:44:10,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:44:10,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:10,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:44:10,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:44:10,825 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 202 [2021-06-11 15:44:10,828 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,828 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:10,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 202 [2021-06-11 15:44:10,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:10,892 INFO L129 PetriNetUnfolder]: 49/143 cut-off events. [2021-06-11 15:44:10,892 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:10,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 143 events. 49/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 631 event pairs, 38 based on Foata normal form. 35/159 useless extension candidates. Maximal degree in co-relation 229. Up to 65 conditions per place. [2021-06-11 15:44:10,895 INFO L132 encePairwiseOnDemand]: 197/202 looper letters, 9 selfloop transitions, 2 changer transitions 1/31 dead transitions. [2021-06-11 15:44:10,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 93 flow [2021-06-11 15:44:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:44:10,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:44:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2021-06-11 15:44:10,908 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.858085808580858 [2021-06-11 15:44:10,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2021-06-11 15:44:10,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2021-06-11 15:44:10,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:10,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2021-06-11 15:44:10,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,923 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,925 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 69 flow. Second operand 3 states and 520 transitions. [2021-06-11 15:44:10,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 93 flow [2021-06-11 15:44:10,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 90 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 15:44:10,928 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 62 flow [2021-06-11 15:44:10,931 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-06-11 15:44:10,931 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2021-06-11 15:44:10,931 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:10,931 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 62 flow [2021-06-11 15:44:10,932 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 62 flow [2021-06-11 15:44:10,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 62 flow [2021-06-11 15:44:10,937 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-06-11 15:44:10,937 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:10,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 44 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:44:10,937 INFO L151 LiptonReduction]: Number of co-enabled transitions 340 [2021-06-11 15:44:10,973 INFO L163 LiptonReduction]: Checked pairs total: 412 [2021-06-11 15:44:10,973 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:10,973 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-06-11 15:44:10,974 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 62 flow [2021-06-11 15:44:10,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:10,974 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:10,974 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:10,974 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 15:44:10,974 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash 516532418, now seen corresponding path program 1 times [2021-06-11 15:44:10,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:10,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063720288] [2021-06-11 15:44:10,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:11,026 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:44:11,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:44:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:11,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063720288] [2021-06-11 15:44:11,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:11,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:44:11,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461392599] [2021-06-11 15:44:11,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:44:11,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:11,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:44:11,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:44:11,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 202 [2021-06-11 15:44:11,037 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:11,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 202 [2021-06-11 15:44:11,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:11,089 INFO L129 PetriNetUnfolder]: 148/399 cut-off events. [2021-06-11 15:44:11,090 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:44:11,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 399 events. 148/399 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2518 event pairs, 58 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 663. Up to 181 conditions per place. [2021-06-11 15:44:11,091 INFO L132 encePairwiseOnDemand]: 193/202 looper letters, 7 selfloop transitions, 7 changer transitions 2/33 dead transitions. [2021-06-11 15:44:11,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 108 flow [2021-06-11 15:44:11,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:44:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:44:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2021-06-11 15:44:11,093 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7706270627062707 [2021-06-11 15:44:11,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2021-06-11 15:44:11,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2021-06-11 15:44:11,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:11,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2021-06-11 15:44:11,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,096 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 62 flow. Second operand 3 states and 467 transitions. [2021-06-11 15:44:11,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 108 flow [2021-06-11 15:44:11,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:44:11,097 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 110 flow [2021-06-11 15:44:11,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-06-11 15:44:11,097 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-06-11 15:44:11,097 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:11,097 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 110 flow [2021-06-11 15:44:11,098 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 110 flow [2021-06-11 15:44:11,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 31 transitions, 110 flow [2021-06-11 15:44:11,115 INFO L129 PetriNetUnfolder]: 72/237 cut-off events. [2021-06-11 15:44:11,115 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-06-11 15:44:11,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 237 events. 72/237 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1351 event pairs, 34 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 434. Up to 117 conditions per place. [2021-06-11 15:44:11,117 INFO L151 LiptonReduction]: Number of co-enabled transitions 382 [2021-06-11 15:44:11,128 INFO L163 LiptonReduction]: Checked pairs total: 250 [2021-06-11 15:44:11,128 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:11,128 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-06-11 15:44:11,129 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 110 flow [2021-06-11 15:44:11,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:11,129 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:11,129 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 15:44:11,129 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1040872098, now seen corresponding path program 1 times [2021-06-11 15:44:11,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:11,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425491009] [2021-06-11 15:44:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:11,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:11,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425491009] [2021-06-11 15:44:11,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:11,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:44:11,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061241340] [2021-06-11 15:44:11,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:44:11,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:44:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:44:11,169 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2021-06-11 15:44:11,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:11,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2021-06-11 15:44:11,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:11,195 INFO L129 PetriNetUnfolder]: 57/191 cut-off events. [2021-06-11 15:44:11,196 INFO L130 PetriNetUnfolder]: For 58/67 co-relation queries the response was YES. [2021-06-11 15:44:11,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 191 events. 57/191 cut-off events. For 58/67 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 960 event pairs, 24 based on Foata normal form. 2/187 useless extension candidates. Maximal degree in co-relation 383. Up to 96 conditions per place. [2021-06-11 15:44:11,197 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 1 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-06-11 15:44:11,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 118 flow [2021-06-11 15:44:11,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:44:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:44:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2021-06-11 15:44:11,199 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8531353135313532 [2021-06-11 15:44:11,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2021-06-11 15:44:11,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2021-06-11 15:44:11,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:11,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2021-06-11 15:44:11,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,201 INFO L185 Difference]: Start difference. First operand has 36 places, 31 transitions, 110 flow. Second operand 3 states and 517 transitions. [2021-06-11 15:44:11,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 118 flow [2021-06-11 15:44:11,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:44:11,204 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 107 flow [2021-06-11 15:44:11,204 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-06-11 15:44:11,204 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2021-06-11 15:44:11,204 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:11,205 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 107 flow [2021-06-11 15:44:11,205 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 107 flow [2021-06-11 15:44:11,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 107 flow [2021-06-11 15:44:11,219 INFO L129 PetriNetUnfolder]: 57/195 cut-off events. [2021-06-11 15:44:11,219 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-11 15:44:11,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 195 events. 57/195 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1017 event pairs, 24 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 350. Up to 96 conditions per place. [2021-06-11 15:44:11,221 INFO L151 LiptonReduction]: Number of co-enabled transitions 380 [2021-06-11 15:44:11,223 INFO L163 LiptonReduction]: Checked pairs total: 248 [2021-06-11 15:44:11,223 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:11,223 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-06-11 15:44:11,223 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 107 flow [2021-06-11 15:44:11,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:11,224 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:11,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 15:44:11,224 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:11,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:11,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1856004805, now seen corresponding path program 1 times [2021-06-11 15:44:11,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:11,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550555332] [2021-06-11 15:44:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:11,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:11,257 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:44:11,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:44:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:11,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550555332] [2021-06-11 15:44:11,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:11,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:44:11,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451648586] [2021-06-11 15:44:11,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:44:11,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:11,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:44:11,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:44:11,266 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 202 [2021-06-11 15:44:11,266 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,266 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:11,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 202 [2021-06-11 15:44:11,266 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:11,303 INFO L129 PetriNetUnfolder]: 39/153 cut-off events. [2021-06-11 15:44:11,303 INFO L130 PetriNetUnfolder]: For 44/88 co-relation queries the response was YES. [2021-06-11 15:44:11,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 153 events. 39/153 cut-off events. For 44/88 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 708 event pairs, 12 based on Foata normal form. 11/159 useless extension candidates. Maximal degree in co-relation 355. Up to 70 conditions per place. [2021-06-11 15:44:11,305 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 12 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2021-06-11 15:44:11,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 171 flow [2021-06-11 15:44:11,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:44:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:44:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2021-06-11 15:44:11,307 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7611386138613861 [2021-06-11 15:44:11,307 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 615 transitions. [2021-06-11 15:44:11,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions. [2021-06-11 15:44:11,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:11,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions. [2021-06-11 15:44:11,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,310 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,310 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 107 flow. Second operand 4 states and 615 transitions. [2021-06-11 15:44:11,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 171 flow [2021-06-11 15:44:11,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:44:11,312 INFO L241 Difference]: Finished difference. Result has 41 places, 34 transitions, 150 flow [2021-06-11 15:44:11,312 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2021-06-11 15:44:11,312 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2021-06-11 15:44:11,312 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:11,313 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 150 flow [2021-06-11 15:44:11,313 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 150 flow [2021-06-11 15:44:11,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 150 flow [2021-06-11 15:44:11,349 INFO L129 PetriNetUnfolder]: 39/165 cut-off events. [2021-06-11 15:44:11,349 INFO L130 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2021-06-11 15:44:11,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 165 events. 39/165 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 858 event pairs, 16 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 349. Up to 70 conditions per place. [2021-06-11 15:44:11,351 INFO L151 LiptonReduction]: Number of co-enabled transitions 418 [2021-06-11 15:44:11,354 INFO L163 LiptonReduction]: Checked pairs total: 302 [2021-06-11 15:44:11,354 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:11,355 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-06-11 15:44:11,356 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 150 flow [2021-06-11 15:44:11,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,357 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:11,357 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:11,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 15:44:11,357 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:11,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:11,357 INFO L82 PathProgramCache]: Analyzing trace with hash -598361504, now seen corresponding path program 1 times [2021-06-11 15:44:11,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:11,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720956992] [2021-06-11 15:44:11,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:11,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:11,438 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:44:11,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:11,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:11,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720956992] [2021-06-11 15:44:11,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:11,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:44:11,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081945209] [2021-06-11 15:44:11,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:44:11,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:11,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:44:11,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:44:11,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 202 [2021-06-11 15:44:11,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:11,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 202 [2021-06-11 15:44:11,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:11,512 INFO L129 PetriNetUnfolder]: 213/522 cut-off events. [2021-06-11 15:44:11,512 INFO L130 PetriNetUnfolder]: For 101/111 co-relation queries the response was YES. [2021-06-11 15:44:11,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 522 events. 213/522 cut-off events. For 101/111 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3569 event pairs, 62 based on Foata normal form. 42/470 useless extension candidates. Maximal degree in co-relation 1117. Up to 226 conditions per place. [2021-06-11 15:44:11,515 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 8 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2021-06-11 15:44:11,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 208 flow [2021-06-11 15:44:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:44:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:44:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 815 transitions. [2021-06-11 15:44:11,517 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.806930693069307 [2021-06-11 15:44:11,517 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 815 transitions. [2021-06-11 15:44:11,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 815 transitions. [2021-06-11 15:44:11,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:11,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 815 transitions. [2021-06-11 15:44:11,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,520 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,521 INFO L185 Difference]: Start difference. First operand has 41 places, 34 transitions, 150 flow. Second operand 5 states and 815 transitions. [2021-06-11 15:44:11,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 208 flow [2021-06-11 15:44:11,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:44:11,525 INFO L241 Difference]: Finished difference. Result has 47 places, 42 transitions, 216 flow [2021-06-11 15:44:11,525 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2021-06-11 15:44:11,525 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2021-06-11 15:44:11,525 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:11,525 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 216 flow [2021-06-11 15:44:11,526 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 216 flow [2021-06-11 15:44:11,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 216 flow [2021-06-11 15:44:11,555 INFO L129 PetriNetUnfolder]: 169/444 cut-off events. [2021-06-11 15:44:11,555 INFO L130 PetriNetUnfolder]: For 309/416 co-relation queries the response was YES. [2021-06-11 15:44:11,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 444 events. 169/444 cut-off events. For 309/416 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3054 event pairs, 60 based on Foata normal form. 9/393 useless extension candidates. Maximal degree in co-relation 1212. Up to 233 conditions per place. [2021-06-11 15:44:11,559 INFO L151 LiptonReduction]: Number of co-enabled transitions 620 [2021-06-11 15:44:11,573 INFO L163 LiptonReduction]: Checked pairs total: 384 [2021-06-11 15:44:11,573 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:11,574 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-06-11 15:44:11,576 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 216 flow [2021-06-11 15:44:11,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,576 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:11,576 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:11,576 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 15:44:11,576 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1503508728, now seen corresponding path program 1 times [2021-06-11 15:44:11,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:11,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606993268] [2021-06-11 15:44:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:11,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:11,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:11,651 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 15:44:11,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 15:44:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:11,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606993268] [2021-06-11 15:44:11,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:11,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:44:11,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808886054] [2021-06-11 15:44:11,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:44:11,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:11,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:44:11,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:44:11,661 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 202 [2021-06-11 15:44:11,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:11,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 202 [2021-06-11 15:44:11,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:11,748 INFO L129 PetriNetUnfolder]: 247/653 cut-off events. [2021-06-11 15:44:11,749 INFO L130 PetriNetUnfolder]: For 628/872 co-relation queries the response was YES. [2021-06-11 15:44:11,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1924 conditions, 653 events. 247/653 cut-off events. For 628/872 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 4939 event pairs, 71 based on Foata normal form. 34/609 useless extension candidates. Maximal degree in co-relation 1905. Up to 361 conditions per place. [2021-06-11 15:44:11,753 INFO L132 encePairwiseOnDemand]: 193/202 looper letters, 11 selfloop transitions, 19 changer transitions 0/54 dead transitions. [2021-06-11 15:44:11,753 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 343 flow [2021-06-11 15:44:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:44:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:44:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 749 transitions. [2021-06-11 15:44:11,754 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7415841584158416 [2021-06-11 15:44:11,754 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 749 transitions. [2021-06-11 15:44:11,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 749 transitions. [2021-06-11 15:44:11,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:11,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 749 transitions. [2021-06-11 15:44:11,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,758 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,758 INFO L185 Difference]: Start difference. First operand has 47 places, 42 transitions, 216 flow. Second operand 5 states and 749 transitions. [2021-06-11 15:44:11,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 343 flow [2021-06-11 15:44:11,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 343 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:44:11,762 INFO L241 Difference]: Finished difference. Result has 54 places, 52 transitions, 353 flow [2021-06-11 15:44:11,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2021-06-11 15:44:11,763 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 15 predicate places. [2021-06-11 15:44:11,763 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:11,763 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 52 transitions, 353 flow [2021-06-11 15:44:11,763 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 353 flow [2021-06-11 15:44:11,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 353 flow [2021-06-11 15:44:11,802 INFO L129 PetriNetUnfolder]: 236/612 cut-off events. [2021-06-11 15:44:11,803 INFO L130 PetriNetUnfolder]: For 659/806 co-relation queries the response was YES. [2021-06-11 15:44:11,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 612 events. 236/612 cut-off events. For 659/806 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 4544 event pairs, 70 based on Foata normal form. 13/553 useless extension candidates. Maximal degree in co-relation 1830. Up to 327 conditions per place. [2021-06-11 15:44:11,808 INFO L151 LiptonReduction]: Number of co-enabled transitions 806 [2021-06-11 15:44:11,814 INFO L163 LiptonReduction]: Checked pairs total: 468 [2021-06-11 15:44:11,814 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:11,814 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-06-11 15:44:11,816 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 353 flow [2021-06-11 15:44:11,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,816 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:11,816 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:11,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 15:44:11,816 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:11,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:11,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1270053064, now seen corresponding path program 2 times [2021-06-11 15:44:11,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:11,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155415939] [2021-06-11 15:44:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:11,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:11,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:11,870 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:44:11,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:11,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:11,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:11,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:11,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155415939] [2021-06-11 15:44:11,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:11,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:44:11,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569923437] [2021-06-11 15:44:11,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:44:11,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:11,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:44:11,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:44:11,878 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 202 [2021-06-11 15:44:11,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 353 flow. Second operand has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:11,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 202 [2021-06-11 15:44:11,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:11,958 INFO L129 PetriNetUnfolder]: 215/576 cut-off events. [2021-06-11 15:44:11,959 INFO L130 PetriNetUnfolder]: For 991/1803 co-relation queries the response was YES. [2021-06-11 15:44:11,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 576 events. 215/576 cut-off events. For 991/1803 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4125 event pairs, 12 based on Foata normal form. 225/738 useless extension candidates. Maximal degree in co-relation 2108. Up to 303 conditions per place. [2021-06-11 15:44:11,963 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 5 selfloop transitions, 18 changer transitions 3/63 dead transitions. [2021-06-11 15:44:11,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 468 flow [2021-06-11 15:44:11,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:44:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:44:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1141 transitions. [2021-06-11 15:44:11,965 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.806930693069307 [2021-06-11 15:44:11,965 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1141 transitions. [2021-06-11 15:44:11,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1141 transitions. [2021-06-11 15:44:11,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:11,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1141 transitions. [2021-06-11 15:44:11,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,969 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:11,969 INFO L185 Difference]: Start difference. First operand has 54 places, 52 transitions, 353 flow. Second operand 7 states and 1141 transitions. [2021-06-11 15:44:11,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 468 flow [2021-06-11 15:44:11,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 63 transitions, 468 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:44:11,973 INFO L241 Difference]: Finished difference. Result has 63 places, 60 transitions, 466 flow [2021-06-11 15:44:11,973 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=466, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2021-06-11 15:44:11,973 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2021-06-11 15:44:11,973 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:11,973 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 60 transitions, 466 flow [2021-06-11 15:44:11,973 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 60 transitions, 466 flow [2021-06-11 15:44:11,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 60 transitions, 466 flow [2021-06-11 15:44:12,008 INFO L129 PetriNetUnfolder]: 193/543 cut-off events. [2021-06-11 15:44:12,008 INFO L130 PetriNetUnfolder]: For 1684/2086 co-relation queries the response was YES. [2021-06-11 15:44:12,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2249 conditions, 543 events. 193/543 cut-off events. For 1684/2086 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 3899 event pairs, 10 based on Foata normal form. 1/483 useless extension candidates. Maximal degree in co-relation 2222. Up to 274 conditions per place. [2021-06-11 15:44:12,015 INFO L151 LiptonReduction]: Number of co-enabled transitions 944 [2021-06-11 15:44:12,048 INFO L163 LiptonReduction]: Checked pairs total: 736 [2021-06-11 15:44:12,049 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:12,049 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-06-11 15:44:12,049 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 466 flow [2021-06-11 15:44:12,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:12,049 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:12,049 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:12,050 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 15:44:12,050 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:12,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1438402630, now seen corresponding path program 1 times [2021-06-11 15:44:12,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:12,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105856140] [2021-06-11 15:44:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:44:12,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:12,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:12,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:12,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:12,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:12,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:44:12,131 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 15:44:12,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:44:12,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:44:12,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:44:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:44:12,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105856140] [2021-06-11 15:44:12,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:44:12,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:44:12,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212741740] [2021-06-11 15:44:12,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:44:12,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:44:12,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:44:12,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:44:12,140 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 202 [2021-06-11 15:44:12,140 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 466 flow. Second operand has 6 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-06-11 15:44:12,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:44:12,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 202 [2021-06-11 15:44:12,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:44:12,235 INFO L129 PetriNetUnfolder]: 180/505 cut-off events. [2021-06-11 15:44:12,236 INFO L130 PetriNetUnfolder]: For 2389/4000 co-relation queries the response was YES. [2021-06-11 15:44:12,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2457 conditions, 505 events. 180/505 cut-off events. For 2389/4000 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 3647 event pairs, 4 based on Foata normal form. 219/662 useless extension candidates. Maximal degree in co-relation 2428. Up to 264 conditions per place. [2021-06-11 15:44:12,240 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 2 selfloop transitions, 22 changer transitions 4/65 dead transitions. [2021-06-11 15:44:12,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 65 transitions, 560 flow [2021-06-11 15:44:12,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:44:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:44:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1461 transitions. [2021-06-11 15:44:12,242 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8036303630363036 [2021-06-11 15:44:12,243 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1461 transitions. [2021-06-11 15:44:12,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1461 transitions. [2021-06-11 15:44:12,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:44:12,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1461 transitions. [2021-06-11 15:44:12,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 162.33333333333334) internal successors, (1461), 9 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:12,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:12,247 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:44:12,247 INFO L185 Difference]: Start difference. First operand has 63 places, 60 transitions, 466 flow. Second operand 9 states and 1461 transitions. [2021-06-11 15:44:12,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 65 transitions, 560 flow [2021-06-11 15:44:12,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 503 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-06-11 15:44:12,257 INFO L241 Difference]: Finished difference. Result has 69 places, 61 transitions, 479 flow [2021-06-11 15:44:12,257 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=479, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2021-06-11 15:44:12,257 INFO L343 CegarLoopForPetriNet]: 39 programPoint places, 30 predicate places. [2021-06-11 15:44:12,257 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:44:12,257 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 61 transitions, 479 flow [2021-06-11 15:44:12,257 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 61 transitions, 479 flow [2021-06-11 15:44:12,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 61 transitions, 479 flow [2021-06-11 15:44:12,288 INFO L129 PetriNetUnfolder]: 174/493 cut-off events. [2021-06-11 15:44:12,288 INFO L130 PetriNetUnfolder]: For 1483/1613 co-relation queries the response was YES. [2021-06-11 15:44:12,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2043 conditions, 493 events. 174/493 cut-off events. For 1483/1613 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 3668 event pairs, 3 based on Foata normal form. 1/439 useless extension candidates. Maximal degree in co-relation 2015. Up to 160 conditions per place. [2021-06-11 15:44:12,294 INFO L151 LiptonReduction]: Number of co-enabled transitions 890 [2021-06-11 15:44:12,302 INFO L163 LiptonReduction]: Checked pairs total: 694 [2021-06-11 15:44:12,302 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:44:12,302 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-06-11 15:44:12,302 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 479 flow [2021-06-11 15:44:12,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 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-06-11 15:44:12,303 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:44:12,303 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:44:12,303 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 15:44:12,303 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:44:12,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:44:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1521786383, now seen corresponding path program 1 times [2021-06-11 15:44:12,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:44:12,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409004448] [2021-06-11 15:44:12,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:44:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:44:12,334 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:44:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:44:12,367 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:44:12,387 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:44:12,387 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:44:12,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 15:44:12,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:44:12 BasicIcfg [2021-06-11 15:44:12,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:44:12,451 INFO L168 Benchmark]: Toolchain (without parser) took 9534.02 ms. Allocated memory was 346.0 MB in the beginning and 536.9 MB in the end (delta: 190.8 MB). Free memory was 308.0 MB in the beginning and 367.5 MB in the end (delta: -59.5 MB). Peak memory consumption was 133.4 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:12,451 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 346.0 MB. Free memory is still 326.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:44:12,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.14 ms. Allocated memory is still 346.0 MB. Free memory was 307.8 MB in the beginning and 304.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:12,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.47 ms. Allocated memory is still 346.0 MB. Free memory was 304.5 MB in the beginning and 301.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:12,451 INFO L168 Benchmark]: Boogie Preprocessor took 39.17 ms. Allocated memory is still 346.0 MB. Free memory was 301.9 MB in the beginning and 299.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:12,451 INFO L168 Benchmark]: RCFGBuilder took 1434.83 ms. Allocated memory is still 346.0 MB. Free memory was 299.3 MB in the beginning and 241.4 MB in the end (delta: 57.9 MB). Peak memory consumption was 146.0 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:12,451 INFO L168 Benchmark]: TraceAbstraction took 7522.83 ms. Allocated memory was 346.0 MB in the beginning and 536.9 MB in the end (delta: 190.8 MB). Free memory was 241.4 MB in the beginning and 367.5 MB in the end (delta: -126.1 MB). Peak memory consumption was 65.8 MB. Max. memory is 16.0 GB. [2021-06-11 15:44:12,452 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.13 ms. Allocated memory is still 346.0 MB. Free memory is still 326.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 461.14 ms. Allocated memory is still 346.0 MB. Free memory was 307.8 MB in the beginning and 304.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 59.47 ms. Allocated memory is still 346.0 MB. Free memory was 304.5 MB in the beginning and 301.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.17 ms. Allocated memory is still 346.0 MB. Free memory was 301.9 MB in the beginning and 299.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1434.83 ms. Allocated memory is still 346.0 MB. Free memory was 299.3 MB in the beginning and 241.4 MB in the end (delta: 57.9 MB). Peak memory consumption was 146.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 7522.83 ms. Allocated memory was 346.0 MB in the beginning and 536.9 MB in the end (delta: 190.8 MB). Free memory was 241.4 MB in the beginning and 367.5 MB in the end (delta: -126.1 MB). Peak memory consumption was 65.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5585.5ms, 111 PlacesBefore, 39 PlacesAfterwards, 103 TransitionsBefore, 30 TransitionsAfterwards, 2054 CoEnabledTransitionPairs, 8 FixpointIterations, 40 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 6119 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2738, positive: 2548, positive conditional: 2548, positive unconditional: 0, negative: 190, negative conditional: 190, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2738, positive: 2548, positive conditional: 0, positive unconditional: 2548, negative: 190, negative conditional: 0, negative unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2738, positive: 2548, positive conditional: 0, positive unconditional: 2548, negative: 190, negative conditional: 0, negative unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1728, positive: 1668, positive conditional: 0, positive unconditional: 1668, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1728, positive: 1649, positive conditional: 0, positive unconditional: 1649, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 630, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 547, negative conditional: 0, negative unconditional: 547, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2738, positive: 880, positive conditional: 0, positive unconditional: 880, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 1728, unknown conditional: 0, unknown unconditional: 1728] , Statistics on independence cache: Total cache size (in pairs): 1728, Positive cache size: 1668, Positive conditional cache size: 0, Positive unconditional cache size: 1668, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.6ms, 36 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 412 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, positive: 86, positive conditional: 10, positive unconditional: 76, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, positive: 86, positive conditional: 10, positive unconditional: 76, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 33, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, positive: 85, positive conditional: 10, positive unconditional: 75, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1731, Positive cache size: 1669, Positive conditional cache size: 0, Positive unconditional cache size: 1669, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.5ms, 37 PlacesBefore, 36 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 52, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1738, Positive cache size: 1675, Positive conditional cache size: 0, Positive unconditional cache size: 1675, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.9ms, 37 PlacesBefore, 37 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 248 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1739, Positive cache size: 1676, Positive conditional cache size: 0, Positive unconditional cache size: 1676, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.6ms, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 418 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 302 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1741, Positive cache size: 1678, Positive conditional cache size: 0, Positive unconditional cache size: 1678, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.6ms, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 384 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, positive: 12, positive conditional: 3, positive unconditional: 9, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 12, positive conditional: 3, positive unconditional: 9, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1743, Positive cache size: 1680, Positive conditional cache size: 1, Positive unconditional cache size: 1679, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.9ms, 54 PlacesBefore, 54 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 806 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 468 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1743, Positive cache size: 1680, Positive conditional cache size: 1, Positive unconditional cache size: 1679, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.1ms, 63 PlacesBefore, 63 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 944 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 736 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, positive: 201, positive conditional: 201, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222, positive: 201, positive conditional: 138, positive unconditional: 63, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222, positive: 201, positive conditional: 138, positive unconditional: 63, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 11, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 222, positive: 185, positive conditional: 127, positive unconditional: 58, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 17, unknown conditional: 11, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1760, Positive cache size: 1696, Positive conditional cache size: 12, Positive unconditional cache size: 1684, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.6ms, 69 PlacesBefore, 68 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 890 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 694 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, positive: 146, positive conditional: 146, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, positive: 146, positive conditional: 78, positive unconditional: 68, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, positive: 146, positive conditional: 78, positive unconditional: 68, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 13, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 167, positive: 133, positive conditional: 65, positive unconditional: 68, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1773, Positive cache size: 1709, Positive conditional cache size: 25, Positive unconditional cache size: 1684, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, Eliminated conditions: 41 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t879; [L854] FCALL, FORK 0 pthread_create(&t879, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L855] 0 pthread_t t880; [L856] FCALL, FORK 0 pthread_create(&t880, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L857] 0 pthread_t t881; [L858] FCALL, FORK 0 pthread_create(&t881, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L820] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0) [L820] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L821] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1) [L821] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L822] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used) [L822] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L823] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L824] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3) [L824] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L825] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] EXPR 3 b$flush_delayed ? b$mem_tmp : b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L766] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L831] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L831] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L831] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L864] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L864] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 7378.8ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 651.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5637.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 52 SDtfs, 31 SDslu, 21 SDs, 0 SdLazy, 132 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 123.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 86.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=8, InterpolantAutomatonStates: 39, 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: 25.6ms SsaConstructionTime, 225.3ms SatisfiabilityAnalysisTime, 318.3ms InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...