/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/mix028_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:12:40,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:12:40,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:12:40,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:12:40,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:12:40,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:12:40,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:12:40,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:12:40,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:12:40,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:12:40,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:12:40,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:12:40,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:12:40,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:12:40,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:12:40,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:12:40,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:12:40,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:12:40,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:12:40,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:12:40,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:12:40,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:12:40,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:12:40,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:12:40,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:12:40,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:12:40,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:12:40,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:12:40,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:12:40,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:12:40,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:12:40,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:12:40,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:12:40,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:12:40,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:12:40,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:12:40,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:12:40,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:12:40,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:12:40,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:12:40,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:12:40,127 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:12:40,148 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:12:40,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:12:40,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:12:40,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:12:40,151 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:12:40,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:12:40,151 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:12:40,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:12:40,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:12:40,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:12:40,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:12:40,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:12:40,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:12:40,152 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:12:40,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:12:40,152 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:12:40,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:12:40,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:12:40,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:12:40,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:12:40,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:12:40,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:12:40,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:12:40,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:12:40,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:12:40,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:12:40,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:12:40,153 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:12:40,154 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:12:40,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:12:40,154 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:12:40,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:12:40,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:12:40,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:12:40,443 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:12:40,443 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:12:40,444 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i [2021-03-26 00:12:40,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4eb1392/78eb29f887f740aa9a4e8cee17e15d16/FLAGecd471110 [2021-03-26 00:12:40,990 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:12:40,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i [2021-03-26 00:12:41,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4eb1392/78eb29f887f740aa9a4e8cee17e15d16/FLAGecd471110 [2021-03-26 00:12:41,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee4eb1392/78eb29f887f740aa9a4e8cee17e15d16 [2021-03-26 00:12:41,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:12:41,471 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:12:41,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:12:41,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:12:41,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:12:41,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:41,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625a721d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41, skipping insertion in model container [2021-03-26 00:12:41,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:41,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:12:41,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:12:41,695 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.oepc.i[949,962] [2021-03-26 00:12:41,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:12:41,850 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:12:41,859 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/mix028_tso.oepc.i[949,962] [2021-03-26 00:12:41,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:12:41,969 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:12:41,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41 WrapperNode [2021-03-26 00:12:41,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:12:41,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:12:41,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:12:41,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:12:41,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:42,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:42,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:12:42,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:12:42,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:12:42,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:12:42,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:42,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:42,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:42,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:42,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:42,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:42,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (1/1) ... [2021-03-26 00:12:42,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:12:42,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:12:42,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:12:42,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:12:42,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:12:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:12:42,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:12:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:12:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:12:42,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:12:42,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:12:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:12:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:12:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:12:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:12:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:12:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:12:42,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:12:42,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:12:42,164 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:12:43,754 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:12:43,754 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:12:43,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:12:43 BoogieIcfgContainer [2021-03-26 00:12:43,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:12:43,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:12:43,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:12:43,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:12:43,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:12:41" (1/3) ... [2021-03-26 00:12:43,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9219f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:12:43, skipping insertion in model container [2021-03-26 00:12:43,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:12:41" (2/3) ... [2021-03-26 00:12:43,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9219f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:12:43, skipping insertion in model container [2021-03-26 00:12:43,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:12:43" (3/3) ... [2021-03-26 00:12:43,760 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_tso.oepc.i [2021-03-26 00:12:43,765 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:12:43,768 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:12:43,769 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:12:43,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,796 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,796 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,796 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,796 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,796 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,800 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,800 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,800 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,800 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,800 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,801 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,801 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,801 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,805 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,816 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,816 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:12:43,819 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:12:43,831 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:12:43,843 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:12:43,844 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:12:43,844 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:12:43,844 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:12:43,844 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:12:43,844 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:12:43,844 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:12:43,844 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:12:43,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 00:12:43,883 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 00:12:43,883 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:43,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:12:43,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-26 00:12:43,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-26 00:12:43,898 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:43,906 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 00:12:43,909 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-26 00:12:43,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-26 00:12:43,933 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-26 00:12:43,933 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:43,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 00:12:43,937 INFO L142 LiptonReduction]: Number of co-enabled transitions 1658 [2021-03-26 00:12:45,240 WARN L205 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-26 00:12:45,534 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:12:46,751 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 00:12:47,278 WARN L205 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 00:12:47,764 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:12:48,097 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 00:12:48,222 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:12:49,373 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:12:49,638 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:12:50,254 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:12:50,856 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:12:51,005 INFO L154 LiptonReduction]: Checked pairs total: 3000 [2021-03-26 00:12:51,006 INFO L156 LiptonReduction]: Total number of compositions: 66 [2021-03-26 00:12:51,007 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7110 [2021-03-26 00:12:51,014 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-26 00:12:51,015 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:51,015 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:51,015 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:51,015 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-26 00:12:51,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:51,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1761882991, now seen corresponding path program 1 times [2021-03-26 00:12:51,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:51,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860255117] [2021-03-26 00:12:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:51,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:51,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:51,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:51,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:12:51,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860255117] [2021-03-26 00:12:51,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:51,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:12:51,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664040444] [2021-03-26 00:12:51,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:12:51,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:51,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:12:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:12:51,197 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 164 [2021-03-26 00:12:51,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:51,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:51,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 164 [2021-03-26 00:12:51,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:51,261 INFO L129 PetriNetUnfolder]: 33/111 cut-off events. [2021-03-26 00:12:51,261 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:51,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 111 events. 33/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 426 event pairs, 3 based on Foata normal form. 7/108 useless extension candidates. Maximal degree in co-relation 169. Up to 55 conditions per place. [2021-03-26 00:12:51,263 INFO L132 encePairwiseOnDemand]: 160/164 looper letters, 8 selfloop transitions, 2 changer transitions 5/39 dead transitions. [2021-03-26 00:12:51,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 111 flow [2021-03-26 00:12:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:51,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2021-03-26 00:12:51,277 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902439024390244 [2021-03-26 00:12:51,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2021-03-26 00:12:51,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2021-03-26 00:12:51,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:51,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2021-03-26 00:12:51,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:51,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:51,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:51,293 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 438 transitions. [2021-03-26 00:12:51,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 111 flow [2021-03-26 00:12:51,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:12:51,296 INFO L241 Difference]: Finished difference. Result has 44 places, 31 transitions, 72 flow [2021-03-26 00:12:51,298 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2021-03-26 00:12:51,298 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 00:12:51,298 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:51,298 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 31 transitions, 72 flow [2021-03-26 00:12:51,299 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 31 transitions, 72 flow [2021-03-26 00:12:51,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 72 flow [2021-03-26 00:12:51,304 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-03-26 00:12:51,304 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:51,304 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:12:51,305 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-26 00:12:51,724 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:12:52,001 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 00:12:52,632 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:12:53,219 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:12:53,635 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-03-26 00:12:54,001 INFO L154 LiptonReduction]: Checked pairs total: 1170 [2021-03-26 00:12:54,001 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 00:12:54,001 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2703 [2021-03-26 00:12:54,002 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-26 00:12:54,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:54,002 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:54,003 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:54,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:12:54,003 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-26 00:12:54,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:54,003 INFO L82 PathProgramCache]: Analyzing trace with hash 541907453, now seen corresponding path program 1 times [2021-03-26 00:12:54,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:54,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697502960] [2021-03-26 00:12:54,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:54,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:54,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:54,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:54,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:54,084 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:12:54,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:12:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:12:54,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697502960] [2021-03-26 00:12:54,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:54,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:54,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478554138] [2021-03-26 00:12:54,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:12:54,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:54,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:12:54,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:12:54,090 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 172 [2021-03-26 00:12:54,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:54,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:54,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 172 [2021-03-26 00:12:54,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:54,118 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 00:12:54,118 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:54,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:12:54,119 INFO L132 encePairwiseOnDemand]: 169/172 looper letters, 1 selfloop transitions, 2 changer transitions 1/23 dead transitions. [2021-03-26 00:12:54,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 62 flow [2021-03-26 00:12:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2021-03-26 00:12:54,120 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8798449612403101 [2021-03-26 00:12:54,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2021-03-26 00:12:54,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2021-03-26 00:12:54,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:54,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2021-03-26 00:12:54,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:54,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:54,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:54,122 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 454 transitions. [2021-03-26 00:12:54,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 62 flow [2021-03-26 00:12:54,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:54,123 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 58 flow [2021-03-26 00:12:54,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-26 00:12:54,124 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -14 predicate places. [2021-03-26 00:12:54,124 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:54,124 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 58 flow [2021-03-26 00:12:54,124 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 58 flow [2021-03-26 00:12:54,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 58 flow [2021-03-26 00:12:54,127 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 00:12:54,127 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:12:54,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:12:54,127 INFO L142 LiptonReduction]: Number of co-enabled transitions 202 [2021-03-26 00:12:54,628 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:12:54,754 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:12:55,033 WARN L205 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:12:55,165 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:12:55,176 INFO L154 LiptonReduction]: Checked pairs total: 492 [2021-03-26 00:12:55,177 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:12:55,177 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1053 [2021-03-26 00:12:55,178 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 00:12:55,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,178 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:55,178 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:55,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:12:55,178 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-26 00:12:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash -927048592, now seen corresponding path program 1 times [2021-03-26 00:12:55,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:55,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122405736] [2021-03-26 00:12:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:55,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:55,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:12:55,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122405736] [2021-03-26 00:12:55,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:55,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:12:55,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635101253] [2021-03-26 00:12:55,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:12:55,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:55,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:12:55,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:12:55,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 173 [2021-03-26 00:12:55,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:55,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 173 [2021-03-26 00:12:55,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:55,301 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 00:12:55,301 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-26 00:12:55,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 00:12:55,302 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 3 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-03-26 00:12:55,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 72 flow [2021-03-26 00:12:55,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:55,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-26 00:12:55,303 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8805394990366089 [2021-03-26 00:12:55,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-26 00:12:55,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-26 00:12:55,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:55,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-26 00:12:55,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,305 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 457 transitions. [2021-03-26 00:12:55,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 00:12:55,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:55,306 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 71 flow [2021-03-26 00:12:55,306 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-03-26 00:12:55,306 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -15 predicate places. [2021-03-26 00:12:55,306 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:55,307 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-26 00:12:55,307 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 23 transitions, 71 flow [2021-03-26 00:12:55,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 23 transitions, 71 flow [2021-03-26 00:12:55,310 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 00:12:55,310 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:12:55,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 00:12:55,311 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-26 00:12:55,412 INFO L154 LiptonReduction]: Checked pairs total: 226 [2021-03-26 00:12:55,412 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:55,412 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-26 00:12:55,413 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-26 00:12:55,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,413 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:55,413 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:55,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:12:55,413 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-26 00:12:55,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:55,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1206068597, now seen corresponding path program 1 times [2021-03-26 00:12:55,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:55,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090229554] [2021-03-26 00:12:55,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:55,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:55,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:55,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:55,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:55,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:55,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:12:55,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090229554] [2021-03-26 00:12:55,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:55,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:12:55,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017307388] [2021-03-26 00:12:55,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:12:55,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:12:55,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:12:55,520 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2021-03-26 00:12:55,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:55,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2021-03-26 00:12:55,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:55,559 INFO L129 PetriNetUnfolder]: 45/119 cut-off events. [2021-03-26 00:12:55,559 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-03-26 00:12:55,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 119 events. 45/119 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 540 event pairs, 20 based on Foata normal form. 10/118 useless extension candidates. Maximal degree in co-relation 235. Up to 60 conditions per place. [2021-03-26 00:12:55,561 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 7 selfloop transitions, 7 changer transitions 2/33 dead transitions. [2021-03-26 00:12:55,561 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 123 flow [2021-03-26 00:12:55,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:12:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:12:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2021-03-26 00:12:55,563 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8416184971098266 [2021-03-26 00:12:55,563 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2021-03-26 00:12:55,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2021-03-26 00:12:55,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:55,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2021-03-26 00:12:55,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,566 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,566 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 5 states and 728 transitions. [2021-03-26 00:12:55,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 123 flow [2021-03-26 00:12:55,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 120 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:12:55,569 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 122 flow [2021-03-26 00:12:55,569 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2021-03-26 00:12:55,569 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -9 predicate places. [2021-03-26 00:12:55,569 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:55,571 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 122 flow [2021-03-26 00:12:55,571 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 122 flow [2021-03-26 00:12:55,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 122 flow [2021-03-26 00:12:55,583 INFO L129 PetriNetUnfolder]: 44/117 cut-off events. [2021-03-26 00:12:55,584 INFO L130 PetriNetUnfolder]: For 65/68 co-relation queries the response was YES. [2021-03-26 00:12:55,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 117 events. 44/117 cut-off events. For 65/68 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 517 event pairs, 21 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 293. Up to 62 conditions per place. [2021-03-26 00:12:55,586 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-26 00:12:55,695 INFO L154 LiptonReduction]: Checked pairs total: 438 [2021-03-26 00:12:55,695 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:12:55,696 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 127 [2021-03-26 00:12:55,699 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 116 flow [2021-03-26 00:12:55,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,700 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:55,700 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:55,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:12:55,700 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-26 00:12:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1480054710, now seen corresponding path program 1 times [2021-03-26 00:12:55,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:55,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19400351] [2021-03-26 00:12:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:55,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:55,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:55,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:55,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:12:55,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19400351] [2021-03-26 00:12:55,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:55,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:12:55,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005887896] [2021-03-26 00:12:55,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:12:55,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:55,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:12:55,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:12:55,784 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 173 [2021-03-26 00:12:55,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:55,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 173 [2021-03-26 00:12:55,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:55,810 INFO L129 PetriNetUnfolder]: 48/122 cut-off events. [2021-03-26 00:12:55,810 INFO L130 PetriNetUnfolder]: For 125/149 co-relation queries the response was YES. [2021-03-26 00:12:55,811 INFO L84 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 122 events. 48/122 cut-off events. For 125/149 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 520 event pairs, 23 based on Foata normal form. 9/120 useless extension candidates. Maximal degree in co-relation 336. Up to 78 conditions per place. [2021-03-26 00:12:55,811 INFO L132 encePairwiseOnDemand]: 170/173 looper letters, 3 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-26 00:12:55,811 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 26 transitions, 116 flow [2021-03-26 00:12:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:12:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:12:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2021-03-26 00:12:55,813 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8786127167630058 [2021-03-26 00:12:55,813 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2021-03-26 00:12:55,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2021-03-26 00:12:55,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:55,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2021-03-26 00:12:55,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,815 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,815 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 116 flow. Second operand 3 states and 456 transitions. [2021-03-26 00:12:55,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 26 transitions, 116 flow [2021-03-26 00:12:55,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 110 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:12:55,818 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 109 flow [2021-03-26 00:12:55,818 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2021-03-26 00:12:55,818 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -10 predicate places. [2021-03-26 00:12:55,818 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:55,818 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 109 flow [2021-03-26 00:12:55,818 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 109 flow [2021-03-26 00:12:55,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 109 flow [2021-03-26 00:12:55,828 INFO L129 PetriNetUnfolder]: 48/122 cut-off events. [2021-03-26 00:12:55,828 INFO L130 PetriNetUnfolder]: For 91/101 co-relation queries the response was YES. [2021-03-26 00:12:55,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 122 events. 48/122 cut-off events. For 91/101 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 557 event pairs, 23 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 318. Up to 78 conditions per place. [2021-03-26 00:12:55,829 INFO L142 LiptonReduction]: Number of co-enabled transitions 258 [2021-03-26 00:12:55,912 INFO L154 LiptonReduction]: Checked pairs total: 193 [2021-03-26 00:12:55,912 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:55,912 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-03-26 00:12:55,913 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 109 flow [2021-03-26 00:12:55,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:55,913 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:55,913 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:55,913 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:12:55,913 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-26 00:12:55,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:55,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1641915186, now seen corresponding path program 1 times [2021-03-26 00:12:55,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:55,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096935116] [2021-03-26 00:12:55,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:56,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:56,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:56,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:56,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:56,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:56,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:56,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:56,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:12:56,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096935116] [2021-03-26 00:12:56,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:56,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:12:56,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263620039] [2021-03-26 00:12:56,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:12:56,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:56,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:12:56,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:12:56,022 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2021-03-26 00:12:56,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:56,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2021-03-26 00:12:56,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:56,084 INFO L129 PetriNetUnfolder]: 32/100 cut-off events. [2021-03-26 00:12:56,085 INFO L130 PetriNetUnfolder]: For 81/116 co-relation queries the response was YES. [2021-03-26 00:12:56,085 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 100 events. 32/100 cut-off events. For 81/116 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 374 event pairs, 4 based on Foata normal form. 19/112 useless extension candidates. Maximal degree in co-relation 327. Up to 68 conditions per place. [2021-03-26 00:12:56,085 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 5 selfloop transitions, 7 changer transitions 7/36 dead transitions. [2021-03-26 00:12:56,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 205 flow [2021-03-26 00:12:56,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:12:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:12:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 873 transitions. [2021-03-26 00:12:56,087 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8410404624277457 [2021-03-26 00:12:56,087 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 873 transitions. [2021-03-26 00:12:56,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 873 transitions. [2021-03-26 00:12:56,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:56,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 873 transitions. [2021-03-26 00:12:56,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.5) internal successors, (873), 6 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,090 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,091 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 109 flow. Second operand 6 states and 873 transitions. [2021-03-26 00:12:56,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 205 flow [2021-03-26 00:12:56,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 200 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:12:56,092 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 160 flow [2021-03-26 00:12:56,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2021-03-26 00:12:56,092 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 00:12:56,092 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:56,092 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 29 transitions, 160 flow [2021-03-26 00:12:56,092 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 29 transitions, 160 flow [2021-03-26 00:12:56,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 29 transitions, 160 flow [2021-03-26 00:12:56,099 INFO L129 PetriNetUnfolder]: 22/77 cut-off events. [2021-03-26 00:12:56,099 INFO L130 PetriNetUnfolder]: For 160/179 co-relation queries the response was YES. [2021-03-26 00:12:56,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 77 events. 22/77 cut-off events. For 160/179 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 271 event pairs, 4 based on Foata normal form. 3/75 useless extension candidates. Maximal degree in co-relation 277. Up to 45 conditions per place. [2021-03-26 00:12:56,100 INFO L142 LiptonReduction]: Number of co-enabled transitions 250 [2021-03-26 00:12:56,147 INFO L154 LiptonReduction]: Checked pairs total: 221 [2021-03-26 00:12:56,148 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:56,148 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-26 00:12:56,148 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 160 flow [2021-03-26 00:12:56,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,149 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:56,149 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:56,149 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:12:56,149 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-26 00:12:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1557797503, now seen corresponding path program 1 times [2021-03-26 00:12:56,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:56,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643711163] [2021-03-26 00:12:56,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:56,265 INFO L142 QuantifierPusher]: treesize reduction 12, result has 71.4 percent of original size [2021-03-26 00:12:56,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 00:12:56,288 INFO L142 QuantifierPusher]: treesize reduction 42, result has 48.1 percent of original size [2021-03-26 00:12:56,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:12:56,315 INFO L142 QuantifierPusher]: treesize reduction 42, result has 50.0 percent of original size [2021-03-26 00:12:56,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 00:12:56,346 INFO L142 QuantifierPusher]: treesize reduction 42, result has 46.2 percent of original size [2021-03-26 00:12:56,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 00:12:56,375 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.9 percent of original size [2021-03-26 00:12:56,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-26 00:12:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:12:56,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643711163] [2021-03-26 00:12:56,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:56,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:12:56,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166380712] [2021-03-26 00:12:56,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:12:56,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:56,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:12:56,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:12:56,409 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 173 [2021-03-26 00:12:56,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:56,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 173 [2021-03-26 00:12:56,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:56,564 INFO L129 PetriNetUnfolder]: 78/224 cut-off events. [2021-03-26 00:12:56,564 INFO L130 PetriNetUnfolder]: For 540/594 co-relation queries the response was YES. [2021-03-26 00:12:56,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 224 events. 78/224 cut-off events. For 540/594 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1128 event pairs, 8 based on Foata normal form. 17/230 useless extension candidates. Maximal degree in co-relation 816. Up to 112 conditions per place. [2021-03-26 00:12:56,566 INFO L132 encePairwiseOnDemand]: 168/173 looper letters, 9 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2021-03-26 00:12:56,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 203 flow [2021-03-26 00:12:56,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:12:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:12:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2021-03-26 00:12:56,567 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7890173410404624 [2021-03-26 00:12:56,567 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2021-03-26 00:12:56,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2021-03-26 00:12:56,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:56,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2021-03-26 00:12:56,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,570 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,570 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 160 flow. Second operand 4 states and 546 transitions. [2021-03-26 00:12:56,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 203 flow [2021-03-26 00:12:56,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 169 flow, removed 13 selfloop flow, removed 4 redundant places. [2021-03-26 00:12:56,572 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 152 flow [2021-03-26 00:12:56,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-26 00:12:56,573 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2021-03-26 00:12:56,573 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:56,573 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 152 flow [2021-03-26 00:12:56,573 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 152 flow [2021-03-26 00:12:56,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 152 flow [2021-03-26 00:12:56,587 INFO L129 PetriNetUnfolder]: 49/159 cut-off events. [2021-03-26 00:12:56,587 INFO L130 PetriNetUnfolder]: For 192/218 co-relation queries the response was YES. [2021-03-26 00:12:56,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 159 events. 49/159 cut-off events. For 192/218 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 761 event pairs, 9 based on Foata normal form. 6/155 useless extension candidates. Maximal degree in co-relation 437. Up to 86 conditions per place. [2021-03-26 00:12:56,588 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-26 00:12:56,827 INFO L154 LiptonReduction]: Checked pairs total: 156 [2021-03-26 00:12:56,827 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:12:56,827 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 254 [2021-03-26 00:12:56,828 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 152 flow [2021-03-26 00:12:56,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 134.0) internal successors, (938), 7 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,828 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:12:56,828 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:12:56,828 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:12:56,828 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-26 00:12:56,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:12:56,828 INFO L82 PathProgramCache]: Analyzing trace with hash 390656689, now seen corresponding path program 2 times [2021-03-26 00:12:56,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:12:56,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976464741] [2021-03-26 00:12:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:12:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:12:56,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:56,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:56,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:56,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:56,887 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-26 00:12:56,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:12:56,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:56,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:12:56,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:12:56,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:12:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:12:56,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976464741] [2021-03-26 00:12:56,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:12:56,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:12:56,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306745102] [2021-03-26 00:12:56,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:12:56,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:12:56,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:12:56,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:12:56,896 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2021-03-26 00:12:56,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:12:56,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2021-03-26 00:12:56,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:12:56,938 INFO L129 PetriNetUnfolder]: 32/121 cut-off events. [2021-03-26 00:12:56,938 INFO L130 PetriNetUnfolder]: For 174/259 co-relation queries the response was YES. [2021-03-26 00:12:56,939 INFO L84 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 121 events. 32/121 cut-off events. For 174/259 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 519 event pairs, 0 based on Foata normal form. 54/167 useless extension candidates. Maximal degree in co-relation 401. Up to 71 conditions per place. [2021-03-26 00:12:56,939 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 2 selfloop transitions, 11 changer transitions 5/35 dead transitions. [2021-03-26 00:12:56,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 214 flow [2021-03-26 00:12:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:12:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:12:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1012 transitions. [2021-03-26 00:12:56,941 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8356729975227085 [2021-03-26 00:12:56,941 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1012 transitions. [2021-03-26 00:12:56,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1012 transitions. [2021-03-26 00:12:56,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:12:56,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1012 transitions. [2021-03-26 00:12:56,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.57142857142858) internal successors, (1012), 7 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,944 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:12:56,944 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 152 flow. Second operand 7 states and 1012 transitions. [2021-03-26 00:12:56,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 214 flow [2021-03-26 00:12:56,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 190 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 00:12:56,947 INFO L241 Difference]: Finished difference. Result has 48 places, 30 transitions, 166 flow [2021-03-26 00:12:56,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=166, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2021-03-26 00:12:56,947 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2021-03-26 00:12:56,947 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:12:56,948 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 30 transitions, 166 flow [2021-03-26 00:12:56,948 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 166 flow [2021-03-26 00:12:56,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 30 transitions, 166 flow [2021-03-26 00:12:56,955 INFO L129 PetriNetUnfolder]: 12/61 cut-off events. [2021-03-26 00:12:56,955 INFO L130 PetriNetUnfolder]: For 86/101 co-relation queries the response was YES. [2021-03-26 00:12:56,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 61 events. 12/61 cut-off events. For 86/101 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 167 event pairs, 0 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 186. Up to 30 conditions per place. [2021-03-26 00:12:56,956 INFO L142 LiptonReduction]: Number of co-enabled transitions 172 [2021-03-26 00:12:57,275 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 00:12:57,431 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 00:12:58,196 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-26 00:12:58,409 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 00:13:00,517 WARN L205 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 348 DAG size of output: 276 [2021-03-26 00:13:01,107 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 00:13:01,110 INFO L154 LiptonReduction]: Checked pairs total: 251 [2021-03-26 00:13:01,110 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:13:01,111 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4164 [2021-03-26 00:13:01,111 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 148 flow [2021-03-26 00:13:01,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:01,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:01,111 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-26 00:13:01,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:13:01,112 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-26 00:13:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash -520664192, now seen corresponding path program 1 times [2021-03-26 00:13:01,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:01,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960388437] [2021-03-26 00:13:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:01,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:01,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:01,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:01,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:01,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:01,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:01,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960388437] [2021-03-26 00:13:01,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:01,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:01,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000410341] [2021-03-26 00:13:01,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:13:01,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:01,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:13:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:13:01,147 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 177 [2021-03-26 00:13:01,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:01,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:01,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 177 [2021-03-26 00:13:01,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:01,166 INFO L129 PetriNetUnfolder]: 22/79 cut-off events. [2021-03-26 00:13:01,166 INFO L130 PetriNetUnfolder]: For 397/427 co-relation queries the response was YES. [2021-03-26 00:13:01,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 79 events. 22/79 cut-off events. For 397/427 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 268 event pairs, 0 based on Foata normal form. 10/86 useless extension candidates. Maximal degree in co-relation 249. Up to 40 conditions per place. [2021-03-26 00:13:01,167 INFO L132 encePairwiseOnDemand]: 174/177 looper letters, 3 selfloop transitions, 1 changer transitions 3/26 dead transitions. [2021-03-26 00:13:01,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 26 transitions, 160 flow [2021-03-26 00:13:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:13:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:13:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 606 transitions. [2021-03-26 00:13:01,168 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8559322033898306 [2021-03-26 00:13:01,168 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 606 transitions. [2021-03-26 00:13:01,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 606 transitions. [2021-03-26 00:13:01,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:01,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 606 transitions. [2021-03-26 00:13:01,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:01,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:01,170 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:01,170 INFO L185 Difference]: Start difference. First operand has 42 places, 25 transitions, 148 flow. Second operand 4 states and 606 transitions. [2021-03-26 00:13:01,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 26 transitions, 160 flow [2021-03-26 00:13:01,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 124 flow, removed 9 selfloop flow, removed 8 redundant places. [2021-03-26 00:13:01,171 INFO L241 Difference]: Finished difference. Result has 39 places, 23 transitions, 111 flow [2021-03-26 00:13:01,172 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=112, 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=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2021-03-26 00:13:01,172 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -8 predicate places. [2021-03-26 00:13:01,172 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:01,172 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 23 transitions, 111 flow [2021-03-26 00:13:01,172 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 23 transitions, 111 flow [2021-03-26 00:13:01,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 23 transitions, 111 flow [2021-03-26 00:13:01,175 INFO L129 PetriNetUnfolder]: 7/38 cut-off events. [2021-03-26 00:13:01,175 INFO L130 PetriNetUnfolder]: For 50/53 co-relation queries the response was YES. [2021-03-26 00:13:01,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 38 events. 7/38 cut-off events. For 50/53 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 0 based on Foata normal form. 3/41 useless extension candidates. Maximal degree in co-relation 94. Up to 12 conditions per place. [2021-03-26 00:13:01,176 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-26 00:13:01,830 WARN L205 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 172 [2021-03-26 00:13:02,372 WARN L205 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 169 [2021-03-26 00:13:03,666 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 296 DAG size of output: 252 [2021-03-26 00:13:04,216 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 00:13:04,447 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:13:04,850 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2021-03-26 00:13:04,988 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2021-03-26 00:13:04,991 INFO L154 LiptonReduction]: Checked pairs total: 85 [2021-03-26 00:13:04,991 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:13:04,991 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3819 [2021-03-26 00:13:04,992 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 116 flow [2021-03-26 00:13:04,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:04,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:04,992 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:04,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:13:04,992 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-26 00:13:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:04,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1176577783, now seen corresponding path program 1 times [2021-03-26 00:13:04,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:04,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114205686] [2021-03-26 00:13:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:13:05,044 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:13:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:13:05,085 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:13:05,117 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:13:05,117 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:13:05,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:13:05,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:13:05 BasicIcfg [2021-03-26 00:13:05,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:13:05,191 INFO L168 Benchmark]: Toolchain (without parser) took 23719.66 ms. Allocated memory was 388.0 MB in the beginning and 971.0 MB in the end (delta: 583.0 MB). Free memory was 350.9 MB in the beginning and 440.3 MB in the end (delta: -89.4 MB). Peak memory consumption was 496.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:05,192 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 388.0 MB. Free memory was 369.4 MB in the beginning and 369.3 MB in the end (delta: 76.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:13:05,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 497.74 ms. Allocated memory is still 388.0 MB. Free memory was 350.8 MB in the beginning and 346.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:05,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 388.0 MB. Free memory was 346.1 MB in the beginning and 343.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:05,193 INFO L168 Benchmark]: Boogie Preprocessor took 39.37 ms. Allocated memory is still 388.0 MB. Free memory was 342.0 MB in the beginning and 339.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:05,193 INFO L168 Benchmark]: RCFGBuilder took 1681.50 ms. Allocated memory is still 388.0 MB. Free memory was 339.9 MB in the beginning and 218.3 MB in the end (delta: 121.6 MB). Peak memory consumption was 151.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:05,193 INFO L168 Benchmark]: TraceAbstraction took 21433.82 ms. Allocated memory was 388.0 MB in the beginning and 971.0 MB in the end (delta: 583.0 MB). Free memory was 218.3 MB in the beginning and 440.3 MB in the end (delta: -222.0 MB). Peak memory consumption was 362.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:05,198 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.49 ms. Allocated memory is still 388.0 MB. Free memory was 369.4 MB in the beginning and 369.3 MB in the end (delta: 76.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 497.74 ms. Allocated memory is still 388.0 MB. Free memory was 350.8 MB in the beginning and 346.1 MB in the end (delta: 4.6 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 62.29 ms. Allocated memory is still 388.0 MB. Free memory was 346.1 MB in the beginning and 343.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.37 ms. Allocated memory is still 388.0 MB. Free memory was 342.0 MB in the beginning and 339.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1681.50 ms. Allocated memory is still 388.0 MB. Free memory was 339.9 MB in the beginning and 218.3 MB in the end (delta: 121.6 MB). Peak memory consumption was 151.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21433.82 ms. Allocated memory was 388.0 MB in the beginning and 971.0 MB in the end (delta: 583.0 MB). Free memory was 218.3 MB in the beginning and 440.3 MB in the end (delta: -222.0 MB). Peak memory consumption was 362.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7096.2ms, 103 PlacesBefore, 47 PlacesAfterwards, 95 TransitionsBefore, 38 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 3000 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1472, positive: 1389, positive conditional: 1389, positive unconditional: 0, negative: 83, negative conditional: 83, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1140, positive: 1104, positive conditional: 0, positive unconditional: 1104, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1140, positive: 1104, positive conditional: 0, positive unconditional: 1104, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1140, positive: 1098, positive conditional: 0, positive unconditional: 1098, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 647, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 632, negative conditional: 0, negative unconditional: 632, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1472, positive: 285, positive conditional: 285, positive unconditional: 0, negative: 47, negative conditional: 47, negative unconditional: 0, unknown: 1140, unknown conditional: 1140, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 36, Positive conditional cache size: 36, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2702.1ms, 44 PlacesBefore, 32 PlacesAfterwards, 31 TransitionsBefore, 23 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1170 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 406, positive: 319, positive conditional: 319, positive unconditional: 0, negative: 87, negative conditional: 87, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, positive: 68, positive conditional: 10, positive unconditional: 58, negative: 15, negative conditional: 5, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 83, positive: 68, positive conditional: 10, positive unconditional: 58, negative: 15, negative conditional: 5, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 83, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 15, negative conditional: 5, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 152, negative conditional: 87, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 406, positive: 251, positive conditional: 251, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 83, unknown conditional: 83, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 88, Positive conditional cache size: 88, 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: 1052.7ms, 33 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 492 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 216, positive: 176, positive conditional: 176, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 25, positive conditional: 2, positive unconditional: 23, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 25, positive conditional: 2, positive unconditional: 23, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 190, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 174, negative conditional: 24, negative unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 216, positive: 151, positive conditional: 151, positive unconditional: 0, negative: 31, negative conditional: 31, negative unconditional: 0, unknown: 34, unknown conditional: 34, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 113, Positive conditional cache size: 113, 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: 105.1ms, 32 PlacesBefore, 32 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 226 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 10, positive conditional: 3, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 10, positive conditional: 3, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 99, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 124.2ms, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 438 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 95, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 37, positive: 32, positive conditional: 23, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 32, positive conditional: 23, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 37, unknown conditional: 37, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 143, Positive conditional cache size: 143, Positive unconditional cache size: 0, Negative cache size: 43, Negative conditional cache size: 43, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93.3ms, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 193 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 43, positive conditional: 43, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 8, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 8, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 159, Positive conditional cache size: 159, Positive unconditional cache size: 0, Negative cache size: 47, Negative conditional cache size: 47, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.1ms, 44 PlacesBefore, 42 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 221 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 16, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 16, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 179, Positive conditional cache size: 179, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 253.7ms, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 156 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 38, positive conditional: 38, 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: 16, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 234, positive: 130, positive conditional: 130, positive unconditional: 0, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 191, Positive conditional cache size: 191, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4162.7ms, 48 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 25 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 251 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, positive: 125, positive conditional: 125, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 45, positive conditional: 42, positive unconditional: 3, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, positive: 45, positive conditional: 42, positive unconditional: 3, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 4, negative conditional: 3, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 30, negative conditional: 20, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, positive: 80, positive conditional: 80, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 49, unknown conditional: 49, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 78, Positive conditional cache size: 78, Positive unconditional cache size: 0, Negative cache size: 19, Negative conditional cache size: 19, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3819.3ms, 39 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 85 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 38, positive conditional: 38, 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: 14, positive: 14, positive conditional: 13, 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: 14, positive: 14, positive conditional: 13, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 48, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 14, unknown conditional: 14, 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 - 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 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) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L794] 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) [L794] 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) [L795] 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)) [L795] 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)) [L796] 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)) [L796] 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)) [L797] 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)) [L797] 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)) [L798] 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)) [L798] 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)) [L799] 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)) [L799] 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)) [L800] 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)) [L800] 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)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __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=5, weak$$choice2=1, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 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) [L809] 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) [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 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 [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L813] 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 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L842] 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) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] 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) [L842] 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) [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 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 [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L846] 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 [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __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=9, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, 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, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21276.8ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 552.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7167.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 32 SDtfs, 16 SDslu, 13 SDs, 0 SdLazy, 139 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 204.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 172.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=8, InterpolantAutomatonStates: 38, 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: 32.1ms SsaConstructionTime, 398.6ms SatisfiabilityAnalysisTime, 532.0ms InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...