/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 23:57:28,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 23:57:28,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 23:57:28,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 23:57:28,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 23:57:28,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 23:57:28,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 23:57:28,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 23:57:28,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 23:57:28,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 23:57:28,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 23:57:28,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 23:57:28,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 23:57:28,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 23:57:28,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 23:57:28,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 23:57:28,877 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 23:57:28,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 23:57:28,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 23:57:28,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 23:57:28,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 23:57:28,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 23:57:28,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 23:57:28,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 23:57:28,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 23:57:28,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 23:57:28,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 23:57:28,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 23:57:28,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 23:57:28,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 23:57:28,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 23:57:28,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 23:57:28,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 23:57:28,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 23:57:28,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 23:57:28,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 23:57:28,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 23:57:28,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 23:57:28,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 23:57:28,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 23:57:28,907 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 23:57:28,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-25 23:57:28,944 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 23:57:28,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 23:57:28,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 23:57:28,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 23:57:28,947 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 23:57:28,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 23:57:28,948 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 23:57:28,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 23:57:28,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 23:57:28,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 23:57:28,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 23:57:28,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 23:57:28,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 23:57:28,950 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 23:57:28,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 23:57:28,950 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 23:57:28,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 23:57:28,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 23:57:28,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 23:57:28,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 23:57:28,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 23:57:28,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 23:57:28,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 23:57:28,951 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 23:57:28,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 23:57:28,952 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 23:57:28,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 23:57:28,952 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-25 23:57:28,952 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 23:57:28,952 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 23:57:28,952 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 23:57:29,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 23:57:29,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 23:57:29,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 23:57:29,294 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 23:57:29,294 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 23:57:29,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i [2021-03-25 23:57:29,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daedbda06/4970630d6ac344078656413c5b17d63c/FLAGedd919c5e [2021-03-25 23:57:29,840 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 23:57:29,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i [2021-03-25 23:57:29,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daedbda06/4970630d6ac344078656413c5b17d63c/FLAGedd919c5e [2021-03-25 23:57:30,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daedbda06/4970630d6ac344078656413c5b17d63c [2021-03-25 23:57:30,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 23:57:30,321 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 23:57:30,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 23:57:30,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 23:57:30,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 23:57:30,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:30,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ccd56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30, skipping insertion in model container [2021-03-25 23:57:30,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:30,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 23:57:30,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 23:57:30,577 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i[950,963] [2021-03-25 23:57:30,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 23:57:30,797 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 23:57:30,808 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt.i[950,963] [2021-03-25 23:57:30,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 23:57:30,955 INFO L208 MainTranslator]: Completed translation [2021-03-25 23:57:30,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30 WrapperNode [2021-03-25 23:57:30,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 23:57:30,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 23:57:30,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 23:57:30,958 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 23:57:30,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:30,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:31,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 23:57:31,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 23:57:31,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 23:57:31,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 23:57:31,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:31,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:31,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:31,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:31,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:31,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:31,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (1/1) ... [2021-03-25 23:57:31,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 23:57:31,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 23:57:31,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 23:57:31,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 23:57:31,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 23:57:31,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 23:57:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 23:57:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 23:57:31,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 23:57:31,113 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 23:57:31,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 23:57:31,114 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 23:57:31,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 23:57:31,114 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 23:57:31,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 23:57:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 23:57:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 23:57:31,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 23:57:31,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 23:57:31,117 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 23:57:33,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 23:57:33,009 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 23:57:33,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 11:57:33 BoogieIcfgContainer [2021-03-25 23:57:33,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 23:57:33,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 23:57:33,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 23:57:33,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 23:57:33,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 11:57:30" (1/3) ... [2021-03-25 23:57:33,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173d1481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 11:57:33, skipping insertion in model container [2021-03-25 23:57:33,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 11:57:30" (2/3) ... [2021-03-25 23:57:33,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173d1481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 11:57:33, skipping insertion in model container [2021-03-25 23:57:33,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 11:57:33" (3/3) ... [2021-03-25 23:57:33,016 INFO L111 eAbstractionObserver]: Analyzing ICFG mix003_power.opt.i [2021-03-25 23:57:33,021 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 23:57:33,025 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 23:57:33,025 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 23:57:33,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,059 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,059 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,059 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,060 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,061 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,061 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,061 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,061 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,062 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,073 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,073 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,074 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,074 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,074 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,074 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,074 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,075 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,085 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,086 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,087 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,089 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,089 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,091 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,092 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,094 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,100 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,100 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,101 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 23:57:33,106 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 23:57:33,121 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 23:57:33,138 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 23:57:33,138 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 23:57:33,138 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 23:57:33,139 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 23:57:33,139 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 23:57:33,139 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 23:57:33,139 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 23:57:33,139 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 23:57:33,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-03-25 23:57:33,179 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-25 23:57:33,179 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:57:33,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 23:57:33,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 217 flow [2021-03-25 23:57:33,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2021-03-25 23:57:33,187 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:33,197 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-25 23:57:33,199 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-25 23:57:33,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 205 flow [2021-03-25 23:57:33,243 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-25 23:57:33,243 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:57:33,243 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 23:57:33,246 INFO L142 LiptonReduction]: Number of co-enabled transitions 1658 [2021-03-25 23:57:34,568 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 23:57:34,999 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 23:57:35,137 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 23:57:36,326 INFO L154 LiptonReduction]: Checked pairs total: 2749 [2021-03-25 23:57:36,327 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-25 23:57:36,329 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3143 [2021-03-25 23:57:36,344 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 23:57:36,344 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:57:36,344 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:36,345 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:36,345 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1737790905, now seen corresponding path program 1 times [2021-03-25 23:57:36,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:36,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173952565] [2021-03-25 23:57:36,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:57:36,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:36,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:57:36,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:36,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:57:36,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173952565] [2021-03-25 23:57:36,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:57:36,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 23:57:36,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144598446] [2021-03-25 23:57:36,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 23:57:36,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:57:36,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 23:57:36,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 23:57:36,572 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 169 [2021-03-25 23:57:36,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:36,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:57:36,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 169 [2021-03-25 23:57:36,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:57:36,654 INFO L129 PetriNetUnfolder]: 13/99 cut-off events. [2021-03-25 23:57:36,654 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:57:36,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 99 events. 13/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 373 event pairs, 5 based on Foata normal form. 8/99 useless extension candidates. Maximal degree in co-relation 119. Up to 25 conditions per place. [2021-03-25 23:57:36,657 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 6 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2021-03-25 23:57:36,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 103 flow [2021-03-25 23:57:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 23:57:36,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 23:57:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2021-03-25 23:57:36,675 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2021-03-25 23:57:36,676 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2021-03-25 23:57:36,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2021-03-25 23:57:36,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:57:36,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2021-03-25 23:57:36,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:36,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:36,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:36,697 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 455 transitions. [2021-03-25 23:57:36,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 103 flow [2021-03-25 23:57:36,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 23:57:36,701 INFO L241 Difference]: Finished difference. Result has 46 places, 37 transitions, 84 flow [2021-03-25 23:57:36,704 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2021-03-25 23:57:36,705 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-25 23:57:36,705 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:36,705 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-25 23:57:36,711 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-25 23:57:36,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 84 flow [2021-03-25 23:57:36,718 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-25 23:57:36,718 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:57:36,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 23:57:36,720 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-25 23:57:38,182 INFO L154 LiptonReduction]: Checked pairs total: 1140 [2021-03-25 23:57:38,182 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 23:57:38,182 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1477 [2021-03-25 23:57:38,184 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 62 flow [2021-03-25 23:57:38,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:38,184 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:38,185 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:38,185 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 23:57:38,185 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:38,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:38,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1004847964, now seen corresponding path program 1 times [2021-03-25 23:57:38,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:38,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777835848] [2021-03-25 23:57:38,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:57:38,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:38,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:57:38,301 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 23:57:38,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 23:57:38,313 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 23:57:38,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 23:57:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:57:38,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777835848] [2021-03-25 23:57:38,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:57:38,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:57:38,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844326004] [2021-03-25 23:57:38,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:57:38,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:57:38,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:57:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:57:38,321 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 180 [2021-03-25 23:57:38,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:38,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:57:38,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 180 [2021-03-25 23:57:38,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:57:38,408 INFO L129 PetriNetUnfolder]: 92/223 cut-off events. [2021-03-25 23:57:38,408 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 23:57:38,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 223 events. 92/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1086 event pairs, 26 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 384. Up to 81 conditions per place. [2021-03-25 23:57:38,412 INFO L132 encePairwiseOnDemand]: 172/180 looper letters, 6 selfloop transitions, 4 changer transitions 12/40 dead transitions. [2021-03-25 23:57:38,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 40 transitions, 134 flow [2021-03-25 23:57:38,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 23:57:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 23:57:38,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2021-03-25 23:57:38,414 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8144444444444444 [2021-03-25 23:57:38,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2021-03-25 23:57:38,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2021-03-25 23:57:38,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:57:38,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2021-03-25 23:57:38,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:38,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:38,419 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:38,419 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 62 flow. Second operand 5 states and 733 transitions. [2021-03-25 23:57:38,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 40 transitions, 134 flow [2021-03-25 23:57:38,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 23:57:38,420 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 92 flow [2021-03-25 23:57:38,421 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, 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=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2021-03-25 23:57:38,421 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2021-03-25 23:57:38,421 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:38,421 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 92 flow [2021-03-25 23:57:38,422 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 92 flow [2021-03-25 23:57:38,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 28 transitions, 92 flow [2021-03-25 23:57:38,437 INFO L129 PetriNetUnfolder]: 40/117 cut-off events. [2021-03-25 23:57:38,437 INFO L130 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2021-03-25 23:57:38,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 117 events. 40/117 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 463 event pairs, 26 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 227. Up to 59 conditions per place. [2021-03-25 23:57:38,439 INFO L142 LiptonReduction]: Number of co-enabled transitions 246 [2021-03-25 23:57:38,813 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 23:57:39,404 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 23:57:39,554 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 23:57:39,894 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-25 23:57:40,066 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 23:57:40,071 INFO L154 LiptonReduction]: Checked pairs total: 426 [2021-03-25 23:57:40,072 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 23:57:40,072 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1651 [2021-03-25 23:57:40,073 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 86 flow [2021-03-25 23:57:40,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:40,074 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:40,074 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 23:57:40,074 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:40,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1063904407, now seen corresponding path program 1 times [2021-03-25 23:57:40,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:40,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137421312] [2021-03-25 23:57:40,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:57:40,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:40,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:40,147 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 23:57:40,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 23:57:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:57:40,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137421312] [2021-03-25 23:57:40,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:57:40,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 23:57:40,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569639924] [2021-03-25 23:57:40,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:57:40,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:57:40,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:57:40,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:57:40,162 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2021-03-25 23:57:40,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:57:40,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2021-03-25 23:57:40,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:57:40,208 INFO L129 PetriNetUnfolder]: 36/92 cut-off events. [2021-03-25 23:57:40,208 INFO L130 PetriNetUnfolder]: For 57/84 co-relation queries the response was YES. [2021-03-25 23:57:40,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 92 events. 36/92 cut-off events. For 57/84 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 313 event pairs, 6 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 255. Up to 59 conditions per place. [2021-03-25 23:57:40,210 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 10 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-25 23:57:40,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 128 flow [2021-03-25 23:57:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 23:57:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 23:57:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2021-03-25 23:57:40,214 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8233151183970856 [2021-03-25 23:57:40,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2021-03-25 23:57:40,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2021-03-25 23:57:40,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:57:40,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2021-03-25 23:57:40,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-03-25 23:57:40,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,219 INFO L185 Difference]: Start difference. First operand has 33 places, 25 transitions, 86 flow. Second operand 3 states and 452 transitions. [2021-03-25 23:57:40,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 128 flow [2021-03-25 23:57:40,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 23:57:40,222 INFO L241 Difference]: Finished difference. Result has 35 places, 25 transitions, 93 flow [2021-03-25 23:57:40,222 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2021-03-25 23:57:40,222 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -14 predicate places. [2021-03-25 23:57:40,222 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:40,223 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 93 flow [2021-03-25 23:57:40,223 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 93 flow [2021-03-25 23:57:40,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 93 flow [2021-03-25 23:57:40,238 INFO L129 PetriNetUnfolder]: 29/89 cut-off events. [2021-03-25 23:57:40,238 INFO L130 PetriNetUnfolder]: For 39/43 co-relation queries the response was YES. [2021-03-25 23:57:40,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 89 events. 29/89 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 323 event pairs, 10 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 195. Up to 49 conditions per place. [2021-03-25 23:57:40,240 INFO L142 LiptonReduction]: Number of co-enabled transitions 244 [2021-03-25 23:57:40,301 INFO L154 LiptonReduction]: Checked pairs total: 152 [2021-03-25 23:57:40,301 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:57:40,301 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 79 [2021-03-25 23:57:40,307 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 93 flow [2021-03-25 23:57:40,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:40,307 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:40,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 23:57:40,308 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:40,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:40,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1743946460, now seen corresponding path program 1 times [2021-03-25 23:57:40,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:40,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767997133] [2021-03-25 23:57:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:57:40,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:40,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:40,396 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 23:57:40,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 23:57:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:57:40,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767997133] [2021-03-25 23:57:40,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:57:40,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 23:57:40,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635287764] [2021-03-25 23:57:40,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:57:40,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:57:40,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:57:40,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:57:40,416 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183 [2021-03-25 23:57:40,416 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:57:40,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183 [2021-03-25 23:57:40,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:57:40,445 INFO L129 PetriNetUnfolder]: 28/82 cut-off events. [2021-03-25 23:57:40,445 INFO L130 PetriNetUnfolder]: For 82/98 co-relation queries the response was YES. [2021-03-25 23:57:40,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 82 events. 28/82 cut-off events. For 82/98 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 276 event pairs, 12 based on Foata normal form. 6/87 useless extension candidates. Maximal degree in co-relation 232. Up to 47 conditions per place. [2021-03-25 23:57:40,446 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 10 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-25 23:57:40,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 138 flow [2021-03-25 23:57:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 23:57:40,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 23:57:40,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2021-03-25 23:57:40,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8233151183970856 [2021-03-25 23:57:40,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2021-03-25 23:57:40,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2021-03-25 23:57:40,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:57:40,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2021-03-25 23:57:40,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-03-25 23:57:40,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,452 INFO L185 Difference]: Start difference. First operand has 35 places, 25 transitions, 93 flow. Second operand 3 states and 452 transitions. [2021-03-25 23:57:40,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 138 flow [2021-03-25 23:57:40,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 23:57:40,453 INFO L241 Difference]: Finished difference. Result has 36 places, 25 transitions, 98 flow [2021-03-25 23:57:40,454 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2021-03-25 23:57:40,454 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -13 predicate places. [2021-03-25 23:57:40,454 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:40,454 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 25 transitions, 98 flow [2021-03-25 23:57:40,454 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 98 flow [2021-03-25 23:57:40,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 98 flow [2021-03-25 23:57:40,465 INFO L129 PetriNetUnfolder]: 19/67 cut-off events. [2021-03-25 23:57:40,465 INFO L130 PetriNetUnfolder]: For 32/35 co-relation queries the response was YES. [2021-03-25 23:57:40,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 67 events. 19/67 cut-off events. For 32/35 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 219 event pairs, 7 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 159. Up to 36 conditions per place. [2021-03-25 23:57:40,466 INFO L142 LiptonReduction]: Number of co-enabled transitions 242 [2021-03-25 23:57:40,468 INFO L154 LiptonReduction]: Checked pairs total: 115 [2021-03-25 23:57:40,468 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:57:40,468 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-25 23:57:40,469 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 98 flow [2021-03-25 23:57:40,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,470 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:40,470 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:40,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 23:57:40,470 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:40,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:40,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1309538319, now seen corresponding path program 1 times [2021-03-25 23:57:40,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:40,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259766925] [2021-03-25 23:57:40,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:57:40,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:40,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:40,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:40,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:40,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:40,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:57:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:57:40,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259766925] [2021-03-25 23:57:40,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:57:40,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:57:40,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625703432] [2021-03-25 23:57:40,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:57:40,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:57:40,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:57:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:57:40,548 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 183 [2021-03-25 23:57:40,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,549 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:57:40,549 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 183 [2021-03-25 23:57:40,549 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:57:40,612 INFO L129 PetriNetUnfolder]: 101/245 cut-off events. [2021-03-25 23:57:40,612 INFO L130 PetriNetUnfolder]: For 67/68 co-relation queries the response was YES. [2021-03-25 23:57:40,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 245 events. 101/245 cut-off events. For 67/68 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1328 event pairs, 35 based on Foata normal form. 21/215 useless extension candidates. Maximal degree in co-relation 544. Up to 150 conditions per place. [2021-03-25 23:57:40,614 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 10 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2021-03-25 23:57:40,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 156 flow [2021-03-25 23:57:40,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 23:57:40,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 23:57:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 765 transitions. [2021-03-25 23:57:40,617 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2021-03-25 23:57:40,617 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 765 transitions. [2021-03-25 23:57:40,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 765 transitions. [2021-03-25 23:57:40,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:57:40,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 765 transitions. [2021-03-25 23:57:40,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,621 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,621 INFO L185 Difference]: Start difference. First operand has 36 places, 25 transitions, 98 flow. Second operand 5 states and 765 transitions. [2021-03-25 23:57:40,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 156 flow [2021-03-25 23:57:40,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 23:57:40,624 INFO L241 Difference]: Finished difference. Result has 41 places, 32 transitions, 152 flow [2021-03-25 23:57:40,624 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2021-03-25 23:57:40,625 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2021-03-25 23:57:40,625 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:40,625 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 152 flow [2021-03-25 23:57:40,625 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 152 flow [2021-03-25 23:57:40,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 152 flow [2021-03-25 23:57:40,648 INFO L129 PetriNetUnfolder]: 67/177 cut-off events. [2021-03-25 23:57:40,648 INFO L130 PetriNetUnfolder]: For 138/167 co-relation queries the response was YES. [2021-03-25 23:57:40,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 177 events. 67/177 cut-off events. For 138/167 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 902 event pairs, 24 based on Foata normal form. 3/167 useless extension candidates. Maximal degree in co-relation 504. Up to 89 conditions per place. [2021-03-25 23:57:40,650 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-25 23:57:40,656 INFO L154 LiptonReduction]: Checked pairs total: 240 [2021-03-25 23:57:40,657 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:57:40,657 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-25 23:57:40,661 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 146 flow [2021-03-25 23:57:40,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,662 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:40,662 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:40,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 23:57:40,662 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:40,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash 957963693, now seen corresponding path program 1 times [2021-03-25 23:57:40,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:40,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167135678] [2021-03-25 23:57:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:57:40,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:40,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:40,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:40,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:40,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:40,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:40,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:40,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:57:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:57:40,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167135678] [2021-03-25 23:57:40,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:57:40,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 23:57:40,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449781609] [2021-03-25 23:57:40,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 23:57:40,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:57:40,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 23:57:40,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 23:57:40,792 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 183 [2021-03-25 23:57:40,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 146 flow. Second operand has 5 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-03-25 23:57:40,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:57:40,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 183 [2021-03-25 23:57:40,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:57:40,852 INFO L129 PetriNetUnfolder]: 69/181 cut-off events. [2021-03-25 23:57:40,852 INFO L130 PetriNetUnfolder]: For 185/321 co-relation queries the response was YES. [2021-03-25 23:57:40,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 181 events. 69/181 cut-off events. For 185/321 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 811 event pairs, 8 based on Foata normal form. 38/200 useless extension candidates. Maximal degree in co-relation 585. Up to 99 conditions per place. [2021-03-25 23:57:40,854 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 8 selfloop transitions, 11 changer transitions 3/40 dead transitions. [2021-03-25 23:57:40,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 40 transitions, 234 flow [2021-03-25 23:57:40,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 23:57:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 23:57:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 918 transitions. [2021-03-25 23:57:40,856 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2021-03-25 23:57:40,856 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 918 transitions. [2021-03-25 23:57:40,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 918 transitions. [2021-03-25 23:57:40,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:57:40,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 918 transitions. [2021-03-25 23:57:40,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,861 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:40,861 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 146 flow. Second operand 6 states and 918 transitions. [2021-03-25 23:57:40,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 40 transitions, 234 flow [2021-03-25 23:57:40,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 228 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 23:57:40,866 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 210 flow [2021-03-25 23:57:40,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2021-03-25 23:57:40,866 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2021-03-25 23:57:40,866 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:40,867 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 210 flow [2021-03-25 23:57:40,867 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 210 flow [2021-03-25 23:57:40,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 210 flow [2021-03-25 23:57:40,880 INFO L129 PetriNetUnfolder]: 37/116 cut-off events. [2021-03-25 23:57:40,880 INFO L130 PetriNetUnfolder]: For 199/229 co-relation queries the response was YES. [2021-03-25 23:57:40,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 116 events. 37/116 cut-off events. For 199/229 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 509 event pairs, 8 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 401. Up to 59 conditions per place. [2021-03-25 23:57:40,881 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-25 23:57:40,889 INFO L154 LiptonReduction]: Checked pairs total: 237 [2021-03-25 23:57:40,889 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 23:57:40,889 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-25 23:57:40,893 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 202 flow [2021-03-25 23:57:40,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 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-03-25 23:57:40,893 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:40,893 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:40,893 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 23:57:40,893 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:40,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:40,894 INFO L82 PathProgramCache]: Analyzing trace with hash -833801454, now seen corresponding path program 1 times [2021-03-25 23:57:40,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:40,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343269178] [2021-03-25 23:57:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:57:41,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:41,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:41,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:41,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:41,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:41,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:41,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:41,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:41,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:41,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:57:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:57:41,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343269178] [2021-03-25 23:57:41,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:57:41,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 23:57:41,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034721879] [2021-03-25 23:57:41,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 23:57:41,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:57:41,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 23:57:41,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 23:57:41,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 183 [2021-03-25 23:57:41,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:41,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:57:41,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 183 [2021-03-25 23:57:41,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:57:41,100 INFO L129 PetriNetUnfolder]: 55/137 cut-off events. [2021-03-25 23:57:41,100 INFO L130 PetriNetUnfolder]: For 287/394 co-relation queries the response was YES. [2021-03-25 23:57:41,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 137 events. 55/137 cut-off events. For 287/394 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 6 based on Foata normal form. 26/145 useless extension candidates. Maximal degree in co-relation 495. Up to 68 conditions per place. [2021-03-25 23:57:41,102 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 5 selfloop transitions, 11 changer transitions 4/38 dead transitions. [2021-03-25 23:57:41,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 248 flow [2021-03-25 23:57:41,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 23:57:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 23:57:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1065 transitions. [2021-03-25 23:57:41,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8313817330210773 [2021-03-25 23:57:41,105 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1065 transitions. [2021-03-25 23:57:41,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1065 transitions. [2021-03-25 23:57:41,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:57:41,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1065 transitions. [2021-03-25 23:57:41,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.14285714285714) internal successors, (1065), 7 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:41,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:41,109 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:41,109 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 202 flow. Second operand 7 states and 1065 transitions. [2021-03-25 23:57:41,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 248 flow [2021-03-25 23:57:41,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 216 flow, removed 11 selfloop flow, removed 5 redundant places. [2021-03-25 23:57:41,113 INFO L241 Difference]: Finished difference. Result has 47 places, 32 transitions, 182 flow [2021-03-25 23:57:41,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=182, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2021-03-25 23:57:41,113 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2021-03-25 23:57:41,113 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:41,113 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 32 transitions, 182 flow [2021-03-25 23:57:41,113 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 32 transitions, 182 flow [2021-03-25 23:57:41,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 32 transitions, 182 flow [2021-03-25 23:57:41,123 INFO L129 PetriNetUnfolder]: 24/81 cut-off events. [2021-03-25 23:57:41,124 INFO L130 PetriNetUnfolder]: For 101/105 co-relation queries the response was YES. [2021-03-25 23:57:41,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 81 events. 24/81 cut-off events. For 101/105 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 273 event pairs, 6 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 247. Up to 31 conditions per place. [2021-03-25 23:57:41,125 INFO L142 LiptonReduction]: Number of co-enabled transitions 236 [2021-03-25 23:57:41,464 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 23:57:41,641 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 23:57:42,026 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-03-25 23:57:42,199 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-03-25 23:57:42,202 INFO L154 LiptonReduction]: Checked pairs total: 295 [2021-03-25 23:57:42,202 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 23:57:42,203 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1090 [2021-03-25 23:57:42,203 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 168 flow [2021-03-25 23:57:42,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:42,204 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:42,204 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:42,204 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 23:57:42,204 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:42,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:42,204 INFO L82 PathProgramCache]: Analyzing trace with hash 93724480, now seen corresponding path program 1 times [2021-03-25 23:57:42,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:42,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897355510] [2021-03-25 23:57:42,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:57:42,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:42,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 23:57:42,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:42,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:42,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:42,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:57:42,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897355510] [2021-03-25 23:57:42,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:57:42,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 23:57:42,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287375274] [2021-03-25 23:57:42,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 23:57:42,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:57:42,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 23:57:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 23:57:42,257 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 185 [2021-03-25 23:57:42,257 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:42,257 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:57:42,257 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 185 [2021-03-25 23:57:42,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:57:42,288 INFO L129 PetriNetUnfolder]: 36/113 cut-off events. [2021-03-25 23:57:42,289 INFO L130 PetriNetUnfolder]: For 255/268 co-relation queries the response was YES. [2021-03-25 23:57:42,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 113 events. 36/113 cut-off events. For 255/268 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 448 event pairs, 8 based on Foata normal form. 9/120 useless extension candidates. Maximal degree in co-relation 354. Up to 41 conditions per place. [2021-03-25 23:57:42,290 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 3 selfloop transitions, 1 changer transitions 2/30 dead transitions. [2021-03-25 23:57:42,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 30 transitions, 182 flow [2021-03-25 23:57:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 23:57:42,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 23:57:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2021-03-25 23:57:42,292 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8243243243243243 [2021-03-25 23:57:42,292 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 610 transitions. [2021-03-25 23:57:42,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 610 transitions. [2021-03-25 23:57:42,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:57:42,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 610 transitions. [2021-03-25 23:57:42,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.5) internal successors, (610), 4 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:42,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:42,295 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:42,295 INFO L185 Difference]: Start difference. First operand has 43 places, 29 transitions, 168 flow. Second operand 4 states and 610 transitions. [2021-03-25 23:57:42,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 30 transitions, 182 flow [2021-03-25 23:57:42,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 140 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-25 23:57:42,297 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 129 flow [2021-03-25 23:57:42,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2021-03-25 23:57:42,297 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -8 predicate places. [2021-03-25 23:57:42,297 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:42,298 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 129 flow [2021-03-25 23:57:42,298 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 129 flow [2021-03-25 23:57:42,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 129 flow [2021-03-25 23:57:42,307 INFO L129 PetriNetUnfolder]: 20/74 cut-off events. [2021-03-25 23:57:42,307 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-03-25 23:57:42,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 74 events. 20/74 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 244 event pairs, 7 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 188. Up to 26 conditions per place. [2021-03-25 23:57:42,308 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-25 23:57:42,313 INFO L154 LiptonReduction]: Checked pairs total: 66 [2021-03-25 23:57:42,313 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 23:57:42,313 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-25 23:57:42,314 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 129 flow [2021-03-25 23:57:42,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:42,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:42,314 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:42,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 23:57:42,314 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:42,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:42,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1060128240, now seen corresponding path program 1 times [2021-03-25 23:57:42,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:42,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311713310] [2021-03-25 23:57:42,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:57:42,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:42,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:42,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:42,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 23:57:42,379 INFO L142 QuantifierPusher]: treesize reduction 9, result has 71.0 percent of original size [2021-03-25 23:57:42,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 23:57:42,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:42,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 23:57:42,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:42,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 23:57:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:57:42,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311713310] [2021-03-25 23:57:42,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:57:42,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 23:57:42,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292290541] [2021-03-25 23:57:42,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 23:57:42,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:57:42,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 23:57:42,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 23:57:42,408 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 185 [2021-03-25 23:57:42,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 129 flow. Second operand has 7 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:42,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:57:42,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 185 [2021-03-25 23:57:42,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:57:42,585 INFO L129 PetriNetUnfolder]: 52/153 cut-off events. [2021-03-25 23:57:42,585 INFO L130 PetriNetUnfolder]: For 322/350 co-relation queries the response was YES. [2021-03-25 23:57:42,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 153 events. 52/153 cut-off events. For 322/350 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 654 event pairs, 1 based on Foata normal form. 21/172 useless extension candidates. Maximal degree in co-relation 448. Up to 52 conditions per place. [2021-03-25 23:57:42,586 INFO L132 encePairwiseOnDemand]: 178/185 looper letters, 7 selfloop transitions, 3 changer transitions 25/52 dead transitions. [2021-03-25 23:57:42,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 299 flow [2021-03-25 23:57:42,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 23:57:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 23:57:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1213 transitions. [2021-03-25 23:57:42,589 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7285285285285286 [2021-03-25 23:57:42,589 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1213 transitions. [2021-03-25 23:57:42,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1213 transitions. [2021-03-25 23:57:42,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:57:42,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1213 transitions. [2021-03-25 23:57:42,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.77777777777777) internal successors, (1213), 9 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:42,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:42,596 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:42,596 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 129 flow. Second operand 9 states and 1213 transitions. [2021-03-25 23:57:42,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 299 flow [2021-03-25 23:57:42,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 296 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 23:57:42,600 INFO L241 Difference]: Finished difference. Result has 52 places, 26 transitions, 143 flow [2021-03-25 23:57:42,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=143, PETRI_PLACES=52, PETRI_TRANSITIONS=26} [2021-03-25 23:57:42,600 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2021-03-25 23:57:42,600 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:42,600 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 26 transitions, 143 flow [2021-03-25 23:57:42,600 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 26 transitions, 143 flow [2021-03-25 23:57:42,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 26 transitions, 143 flow [2021-03-25 23:57:42,607 INFO L129 PetriNetUnfolder]: 9/52 cut-off events. [2021-03-25 23:57:42,607 INFO L130 PetriNetUnfolder]: For 84/85 co-relation queries the response was YES. [2021-03-25 23:57:42,608 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 52 events. 9/52 cut-off events. For 84/85 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 2 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 153. Up to 14 conditions per place. [2021-03-25 23:57:42,608 INFO L142 LiptonReduction]: Number of co-enabled transitions 110 [2021-03-25 23:57:43,111 WARN L205 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 161 [2021-03-25 23:57:43,233 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-03-25 23:57:44,203 WARN L205 SmtUtils]: Spent 962.00 ms on a formula simplification. DAG size of input: 330 DAG size of output: 226 [2021-03-25 23:57:44,468 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2021-03-25 23:57:44,550 INFO L154 LiptonReduction]: Checked pairs total: 92 [2021-03-25 23:57:44,551 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 23:57:44,551 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1951 [2021-03-25 23:57:44,552 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 23 transitions, 137 flow [2021-03-25 23:57:44,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:44,552 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:44,552 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:44,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 23:57:44,552 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1345310108, now seen corresponding path program 2 times [2021-03-25 23:57:44,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:44,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896299229] [2021-03-25 23:57:44,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 23:57:44,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 23:57:44,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 23:57:44,682 INFO L142 QuantifierPusher]: treesize reduction 15, result has 61.5 percent of original size [2021-03-25 23:57:44,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 23:57:44,710 INFO L142 QuantifierPusher]: treesize reduction 42, result has 76.1 percent of original size [2021-03-25 23:57:44,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 134 [2021-03-25 23:57:44,820 INFO L142 QuantifierPusher]: treesize reduction 94, result has 25.4 percent of original size [2021-03-25 23:57:44,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 23:57:44,843 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-25 23:57:44,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 23:57:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 23:57:44,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896299229] [2021-03-25 23:57:44,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 23:57:44,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 23:57:44,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37905988] [2021-03-25 23:57:44,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 23:57:44,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 23:57:44,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 23:57:44,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 23:57:44,853 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 188 [2021-03-25 23:57:44,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 23 transitions, 137 flow. Second operand has 7 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:44,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 23:57:44,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 188 [2021-03-25 23:57:44,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 23:57:44,925 INFO L129 PetriNetUnfolder]: 15/62 cut-off events. [2021-03-25 23:57:44,925 INFO L130 PetriNetUnfolder]: For 220/232 co-relation queries the response was YES. [2021-03-25 23:57:44,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 62 events. 15/62 cut-off events. For 220/232 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 208 event pairs, 2 based on Foata normal form. 7/67 useless extension candidates. Maximal degree in co-relation 209. Up to 20 conditions per place. [2021-03-25 23:57:44,926 INFO L132 encePairwiseOnDemand]: 183/188 looper letters, 2 selfloop transitions, 3 changer transitions 2/25 dead transitions. [2021-03-25 23:57:44,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 25 transitions, 165 flow [2021-03-25 23:57:44,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 23:57:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 23:57:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2021-03-25 23:57:44,928 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.725177304964539 [2021-03-25 23:57:44,928 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 818 transitions. [2021-03-25 23:57:44,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 818 transitions. [2021-03-25 23:57:44,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 23:57:44,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 818 transitions. [2021-03-25 23:57:44,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.33333333333334) internal successors, (818), 6 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:44,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:44,933 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:44,933 INFO L185 Difference]: Start difference. First operand has 44 places, 23 transitions, 137 flow. Second operand 6 states and 818 transitions. [2021-03-25 23:57:44,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 25 transitions, 165 flow [2021-03-25 23:57:44,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 25 transitions, 137 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-03-25 23:57:44,935 INFO L241 Difference]: Finished difference. Result has 45 places, 23 transitions, 129 flow [2021-03-25 23:57:44,935 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=45, PETRI_TRANSITIONS=23} [2021-03-25 23:57:44,935 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2021-03-25 23:57:44,935 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-25 23:57:44,936 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 23 transitions, 129 flow [2021-03-25 23:57:44,936 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 23 transitions, 129 flow [2021-03-25 23:57:44,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 23 transitions, 129 flow [2021-03-25 23:57:44,942 INFO L129 PetriNetUnfolder]: 9/45 cut-off events. [2021-03-25 23:57:44,942 INFO L130 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2021-03-25 23:57:44,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 45 events. 9/45 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 118 event pairs, 2 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 136. Up to 14 conditions per place. [2021-03-25 23:57:44,943 INFO L142 LiptonReduction]: Number of co-enabled transitions 44 [2021-03-25 23:57:45,171 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 23:57:45,531 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-25 23:57:45,683 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 23:57:45,866 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 23:57:46,257 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2021-03-25 23:57:46,385 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-25 23:57:46,561 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-25 23:57:47,001 WARN L205 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2021-03-25 23:57:47,136 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-25 23:57:47,139 INFO L154 LiptonReduction]: Checked pairs total: 19 [2021-03-25 23:57:47,139 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 23:57:47,140 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2205 [2021-03-25 23:57:47,140 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 22 transitions, 141 flow [2021-03-25 23:57:47,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 23:57:47,141 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 23:57:47,141 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 23:57:47,141 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 23:57:47,141 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 23:57:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 23:57:47,142 INFO L82 PathProgramCache]: Analyzing trace with hash -175638125, now seen corresponding path program 1 times [2021-03-25 23:57:47,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 23:57:47,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324821613] [2021-03-25 23:57:47,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 23:57:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 23:57:47,173 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 23:57:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 23:57:47,212 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 23:57:47,237 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 23:57:47,237 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 23:57:47,237 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 23:57:47,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 11:57:47 BasicIcfg [2021-03-25 23:57:47,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 23:57:47,323 INFO L168 Benchmark]: Toolchain (without parser) took 17001.82 ms. Allocated memory was 337.6 MB in the beginning and 692.1 MB in the end (delta: 354.4 MB). Free memory was 300.4 MB in the beginning and 552.8 MB in the end (delta: -252.4 MB). Peak memory consumption was 103.2 MB. Max. memory is 16.0 GB. [2021-03-25 23:57:47,323 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 337.6 MB. Free memory was 318.8 MB in the beginning and 318.7 MB in the end (delta: 125.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 23:57:47,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.52 ms. Allocated memory is still 337.6 MB. Free memory was 300.2 MB in the beginning and 296.4 MB in the end (delta: 3.8 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-25 23:57:47,324 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.17 ms. Allocated memory is still 337.6 MB. Free memory was 296.4 MB in the beginning and 293.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 23:57:47,324 INFO L168 Benchmark]: Boogie Preprocessor took 27.33 ms. Allocated memory is still 337.6 MB. Free memory was 293.2 MB in the beginning and 291.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 23:57:47,325 INFO L168 Benchmark]: RCFGBuilder took 1964.16 ms. Allocated memory is still 337.6 MB. Free memory was 291.1 MB in the beginning and 165.1 MB in the end (delta: 126.0 MB). Peak memory consumption was 139.7 MB. Max. memory is 16.0 GB. [2021-03-25 23:57:47,325 INFO L168 Benchmark]: TraceAbstraction took 14311.13 ms. Allocated memory was 337.6 MB in the beginning and 692.1 MB in the end (delta: 354.4 MB). Free memory was 164.1 MB in the beginning and 552.8 MB in the end (delta: -388.8 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 23:57:47,329 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55 ms. Allocated memory is still 337.6 MB. Free memory was 318.8 MB in the beginning and 318.7 MB in the end (delta: 125.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 633.52 ms. Allocated memory is still 337.6 MB. Free memory was 300.2 MB in the beginning and 296.4 MB in the end (delta: 3.8 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.17 ms. Allocated memory is still 337.6 MB. Free memory was 296.4 MB in the beginning and 293.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 27.33 ms. Allocated memory is still 337.6 MB. Free memory was 293.2 MB in the beginning and 291.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1964.16 ms. Allocated memory is still 337.6 MB. Free memory was 291.1 MB in the beginning and 165.1 MB in the end (delta: 126.0 MB). Peak memory consumption was 139.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14311.13 ms. Allocated memory was 337.6 MB in the beginning and 692.1 MB in the end (delta: 354.4 MB). Free memory was 164.1 MB in the beginning and 552.8 MB in the end (delta: -388.8 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3127.7ms, 106 PlacesBefore, 49 PlacesAfterwards, 98 TransitionsBefore, 40 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 2749 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1752, positive: 1676, positive conditional: 1676, positive unconditional: 0, negative: 76, negative conditional: 76, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1220, positive: 1189, positive conditional: 0, positive unconditional: 1189, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1220, positive: 1189, positive conditional: 0, positive unconditional: 1189, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1220, positive: 1182, positive conditional: 0, positive unconditional: 1182, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 604, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 579, negative conditional: 0, negative unconditional: 579, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1752, positive: 487, positive conditional: 487, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 1220, unknown conditional: 1220, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 84, Positive conditional cache size: 84, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1471.2ms, 46 PlacesBefore, 35 PlacesAfterwards, 37 TransitionsBefore, 26 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 368, positive: 295, positive conditional: 295, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, positive: 105, positive conditional: 18, positive unconditional: 87, negative: 24, negative conditional: 3, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 129, positive: 105, positive conditional: 18, positive unconditional: 87, negative: 24, negative conditional: 3, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 129, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 24, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 24, negative conditional: 3, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 445, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 445, negative conditional: 99, negative unconditional: 345, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 368, positive: 190, positive conditional: 190, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 129, unknown conditional: 129, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 102, Positive conditional cache size: 102, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1650.1ms, 39 PlacesBefore, 33 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 246 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 426 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 139, positive conditional: 139, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 26, positive conditional: 8, positive unconditional: 18, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, positive: 26, positive conditional: 8, positive unconditional: 18, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 158, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 158, negative conditional: 3, negative unconditional: 154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 169, positive: 113, positive conditional: 113, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 128, Positive conditional cache size: 128, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 77.9ms, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 152 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 5, positive unconditional: 8, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 5, positive unconditional: 8, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 58, negative conditional: 45, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 141, Positive conditional cache size: 141, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.7ms, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 115 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 146, Positive conditional cache size: 146, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.5ms, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 240 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 114, positive: 102, positive conditional: 102, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 17, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 17, positive unconditional: 4, 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: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 114, positive: 81, positive conditional: 81, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 137, Positive conditional cache size: 137, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 237 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 110, positive conditional: 110, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 20, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 20, positive unconditional: 6, 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: 26, positive: 26, positive conditional: 0, positive unconditional: 26, 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: 122, positive: 84, positive conditional: 84, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 149, Positive conditional cache size: 149, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1089.1ms, 47 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 29 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 295 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 180, positive: 159, positive conditional: 159, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 17, positive conditional: 17, 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: 17, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 180, positive: 142, positive conditional: 142, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 128, Positive conditional cache size: 128, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.1ms, 41 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 66 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 7, positive unconditional: 1, 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: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 136, Positive conditional cache size: 136, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1950.3ms, 52 PlacesBefore, 44 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 92 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 35, positive conditional: 12, positive unconditional: 23, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 35, positive conditional: 12, positive unconditional: 23, 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: 37, positive: 35, positive conditional: 0, positive unconditional: 35, 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: 39, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 36, Positive cache size: 25, Positive conditional cache size: 25, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2203.6ms, 45 PlacesBefore, 42 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 19 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, 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: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 10, Positive conditional cache size: 10, Positive unconditional cache size: 0, Negative cache size: 4, Negative conditional cache size: 4, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t65; [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t66; [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t67; [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 1 z = 1 [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = y [L782] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L826] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L830] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 14103.1ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 891.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3200.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 57 SDtfs, 53 SDslu, 38 SDs, 0 SdLazy, 213 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 265.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 364.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=6, InterpolantAutomatonStates: 51, 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: 35.6ms SsaConstructionTime, 385.0ms SatisfiabilityAnalysisTime, 790.7ms InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 1027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...