/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/mix036_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:15:41,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:15:41,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:15:41,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:15:41,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:15:41,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:15:41,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:15:41,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:15:41,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:15:41,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:15:41,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:15:41,149 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:15:41,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:15:41,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:15:41,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:15:41,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:15:41,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:15:41,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:15:41,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:15:41,166 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:15:41,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:15:41,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:15:41,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:15:41,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:15:41,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:15:41,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:15:41,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:15:41,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:15:41,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:15:41,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:15:41,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:15:41,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:15:41,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:15:41,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:15:41,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:15:41,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:15:41,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:15:41,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:15:41,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:15:41,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:15:41,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:15:41,186 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:15:41,218 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:15:41,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:15:41,220 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:15:41,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:15:41,220 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:15:41,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:15:41,220 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:15:41,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:15:41,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:15:41,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:15:41,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:15:41,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:15:41,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:15:41,224 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:15:41,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:15:41,225 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:15:41,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:15:41,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:15:41,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:15:41,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:15:41,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:15:41,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:15:41,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:15:41,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:15:41,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:15:41,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:15:41,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:15:41,226 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:15:41,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:15:41,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:15:41,227 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:15:41,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:15:41,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:15:41,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:15:41,593 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:15:41,594 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:15:41,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i [2021-03-26 00:15:41,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d18b6f11/1c8d4d978fe942f38a435cfad6c6ca2b/FLAG26c756cc2 [2021-03-26 00:15:42,082 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:15:42,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.opt.i [2021-03-26 00:15:42,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d18b6f11/1c8d4d978fe942f38a435cfad6c6ca2b/FLAG26c756cc2 [2021-03-26 00:15:42,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d18b6f11/1c8d4d978fe942f38a435cfad6c6ca2b [2021-03-26 00:15:42,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:15:42,107 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:15:42,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:15:42,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:15:42,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:15:42,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55f30f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42, skipping insertion in model container [2021-03-26 00:15:42,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:15:42,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:15:42,364 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/mix036_power.opt.i[950,963] [2021-03-26 00:15:42,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:15:42,582 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:15:42,592 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/mix036_power.opt.i[950,963] [2021-03-26 00:15:42,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:15:42,710 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:15:42,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42 WrapperNode [2021-03-26 00:15:42,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:15:42,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:15:42,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:15:42,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:15:42,717 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:15:42" (1/1) ... [2021-03-26 00:15:42,746 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:15:42" (1/1) ... [2021-03-26 00:15:42,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:15:42,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:15:42,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:15:42,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:15:42,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42" (1/1) ... [2021-03-26 00:15:42,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:15:42,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:15:42,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:15:42,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:15:42,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42" (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:15:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:15:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:15:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:15:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:15:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:15:42,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:15:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:15:42,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:15:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:15:42,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:15:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:15:42,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:15:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:15:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:15:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:15:42,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:15:42,868 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:15:44,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:15:44,420 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:15:44,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:15:44 BoogieIcfgContainer [2021-03-26 00:15:44,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:15:44,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:15:44,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:15:44,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:15:44,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:15:42" (1/3) ... [2021-03-26 00:15:44,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af0da3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:15:44, skipping insertion in model container [2021-03-26 00:15:44,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:15:42" (2/3) ... [2021-03-26 00:15:44,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af0da3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:15:44, skipping insertion in model container [2021-03-26 00:15:44,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:15:44" (3/3) ... [2021-03-26 00:15:44,427 INFO L111 eAbstractionObserver]: Analyzing ICFG mix036_power.opt.i [2021-03-26 00:15:44,432 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:15:44,435 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:15:44,436 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:15:44,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,479 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,479 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,488 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,489 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,490 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,504 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,507 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,507 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,507 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,508 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,508 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,508 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,512 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,512 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,513 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,514 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,515 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,515 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,517 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,520 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,520 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,520 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,521 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:15:44,521 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:15:44,537 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:15:44,562 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:15:44,562 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:15:44,562 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:15:44,563 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:15:44,563 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:15:44,563 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:15:44,563 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:15:44,563 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:15:44,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-03-26 00:15:44,629 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-26 00:15:44,629 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:44,640 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:15:44,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-03-26 00:15:44,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-03-26 00:15:44,648 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:44,657 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-26 00:15:44,660 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-26 00:15:44,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow [2021-03-26 00:15:44,696 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-26 00:15:44,696 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:44,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:15:44,701 INFO L142 LiptonReduction]: Number of co-enabled transitions 2610 [2021-03-26 00:15:46,150 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:15:46,540 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:15:46,680 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:15:48,126 INFO L154 LiptonReduction]: Checked pairs total: 3943 [2021-03-26 00:15:48,126 INFO L156 LiptonReduction]: Total number of compositions: 78 [2021-03-26 00:15:48,128 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3481 [2021-03-26 00:15:48,138 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-26 00:15:48,139 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:48,139 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:48,139 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:48,140 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:48,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:48,144 INFO L82 PathProgramCache]: Analyzing trace with hash -330706863, now seen corresponding path program 1 times [2021-03-26 00:15:48,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:48,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045804660] [2021-03-26 00:15:48,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:48,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:48,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:48,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:48,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:48,352 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:15:48,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045804660] [2021-03-26 00:15:48,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:48,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:15:48,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643001379] [2021-03-26 00:15:48,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:15:48,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:48,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:15:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:15:48,375 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 197 [2021-03-26 00:15:48,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:15:48,382 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:48,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 197 [2021-03-26 00:15:48,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:48,448 INFO L129 PetriNetUnfolder]: 29/146 cut-off events. [2021-03-26 00:15:48,448 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:48,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 146 events. 29/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 608 event pairs, 15 based on Foata normal form. 10/137 useless extension candidates. Maximal degree in co-relation 193. Up to 41 conditions per place. [2021-03-26 00:15:48,452 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 7 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2021-03-26 00:15:48,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 118 flow [2021-03-26 00:15:48,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:15:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:15:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2021-03-26 00:15:48,470 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9238578680203046 [2021-03-26 00:15:48,471 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 546 transitions. [2021-03-26 00:15:48,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 546 transitions. [2021-03-26 00:15:48,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:48,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 546 transitions. [2021-03-26 00:15:48,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.0) internal successors, (546), 3 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:15:48,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:15:48,492 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:15:48,494 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 546 transitions. [2021-03-26 00:15:48,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 118 flow [2021-03-26 00:15:48,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 44 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:15:48,498 INFO L241 Difference]: Finished difference. Result has 52 places, 41 transitions, 94 flow [2021-03-26 00:15:48,499 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2021-03-26 00:15:48,500 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2021-03-26 00:15:48,500 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:48,500 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 94 flow [2021-03-26 00:15:48,501 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 94 flow [2021-03-26 00:15:48,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2021-03-26 00:15:48,513 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-26 00:15:48,513 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:48,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:15:48,514 INFO L142 LiptonReduction]: Number of co-enabled transitions 512 [2021-03-26 00:15:49,682 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-03-26 00:15:50,478 WARN L205 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 00:15:50,648 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 00:15:51,028 WARN L205 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-26 00:15:51,231 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-26 00:15:51,237 INFO L154 LiptonReduction]: Checked pairs total: 2625 [2021-03-26 00:15:51,237 INFO L156 LiptonReduction]: Total number of compositions: 13 [2021-03-26 00:15:51,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2738 [2021-03-26 00:15:51,239 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-03-26 00:15:51,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:15:51,240 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:51,240 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:15:51,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:15:51,240 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:51,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1106261652, now seen corresponding path program 1 times [2021-03-26 00:15:51,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:51,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926451688] [2021-03-26 00:15:51,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:51,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:51,384 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:15:51,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:15:51,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:51,398 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:15:51,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926451688] [2021-03-26 00:15:51,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:51,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:51,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430698929] [2021-03-26 00:15:51,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:51,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:51,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:51,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:51,401 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 210 [2021-03-26 00:15:51,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 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:15:51,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:51,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 210 [2021-03-26 00:15:51,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:51,536 INFO L129 PetriNetUnfolder]: 154/346 cut-off events. [2021-03-26 00:15:51,537 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:15:51,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 607 conditions, 346 events. 154/346 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1845 event pairs, 47 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 598. Up to 124 conditions per place. [2021-03-26 00:15:51,542 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 6 selfloop transitions, 5 changer transitions 12/43 dead transitions. [2021-03-26 00:15:51,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 144 flow [2021-03-26 00:15:51,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:15:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:15:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 894 transitions. [2021-03-26 00:15:51,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8514285714285714 [2021-03-26 00:15:51,545 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 894 transitions. [2021-03-26 00:15:51,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 894 transitions. [2021-03-26 00:15:51,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:51,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 894 transitions. [2021-03-26 00:15:51,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 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:15:51,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:15:51,551 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:15:51,551 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 894 transitions. [2021-03-26 00:15:51,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 144 flow [2021-03-26 00:15:51,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:51,553 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 105 flow [2021-03-26 00:15:51,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-26 00:15:51,554 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -13 predicate places. [2021-03-26 00:15:51,554 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:51,554 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 105 flow [2021-03-26 00:15:51,555 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 105 flow [2021-03-26 00:15:51,555 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 105 flow [2021-03-26 00:15:51,580 INFO L129 PetriNetUnfolder]: 71/180 cut-off events. [2021-03-26 00:15:51,581 INFO L130 PetriNetUnfolder]: For 58/62 co-relation queries the response was YES. [2021-03-26 00:15:51,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 180 events. 71/180 cut-off events. For 58/62 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 813 event pairs, 49 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 393. Up to 109 conditions per place. [2021-03-26 00:15:51,583 INFO L142 LiptonReduction]: Number of co-enabled transitions 404 [2021-03-26 00:15:51,638 INFO L154 LiptonReduction]: Checked pairs total: 213 [2021-03-26 00:15:51,638 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:51,638 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 84 [2021-03-26 00:15:51,640 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 105 flow [2021-03-26 00:15:51,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 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:15:51,640 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:51,641 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:51,641 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:15:51,641 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:51,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:51,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1912861201, now seen corresponding path program 1 times [2021-03-26 00:15:51,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:51,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181450850] [2021-03-26 00:15:51,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:51,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:51,742 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:15:51,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:15:51,751 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:15:51,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181450850] [2021-03-26 00:15:51,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:51,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:15:51,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070370377] [2021-03-26 00:15:51,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:51,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:51,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:51,754 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-26 00:15:51,755 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 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:15:51,755 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:51,755 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-26 00:15:51,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:51,795 INFO L129 PetriNetUnfolder]: 61/157 cut-off events. [2021-03-26 00:15:51,795 INFO L130 PetriNetUnfolder]: For 89/157 co-relation queries the response was YES. [2021-03-26 00:15:51,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 157 events. 61/157 cut-off events. For 89/157 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 618 event pairs, 9 based on Foata normal form. 2/154 useless extension candidates. Maximal degree in co-relation 429. Up to 89 conditions per place. [2021-03-26 00:15:51,799 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 11 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2021-03-26 00:15:51,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 151 flow [2021-03-26 00:15:51,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:15:51,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:15:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2021-03-26 00:15:51,801 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2021-03-26 00:15:51,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 545 transitions. [2021-03-26 00:15:51,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 545 transitions. [2021-03-26 00:15:51,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:51,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 545 transitions. [2021-03-26 00:15:51,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 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:15:51,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:15:51,805 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:15:51,805 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 105 flow. Second operand 3 states and 545 transitions. [2021-03-26 00:15:51,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 151 flow [2021-03-26 00:15:51,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:15:51,809 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 111 flow [2021-03-26 00:15:51,809 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-26 00:15:51,809 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -14 predicate places. [2021-03-26 00:15:51,809 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:51,810 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 111 flow [2021-03-26 00:15:51,811 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 111 flow [2021-03-26 00:15:51,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 111 flow [2021-03-26 00:15:51,837 INFO L129 PetriNetUnfolder]: 54/161 cut-off events. [2021-03-26 00:15:51,837 INFO L130 PetriNetUnfolder]: For 61/71 co-relation queries the response was YES. [2021-03-26 00:15:51,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 161 events. 54/161 cut-off events. For 61/71 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 740 event pairs, 30 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 347. Up to 81 conditions per place. [2021-03-26 00:15:51,840 INFO L142 LiptonReduction]: Number of co-enabled transitions 402 [2021-03-26 00:15:51,852 INFO L154 LiptonReduction]: Checked pairs total: 253 [2021-03-26 00:15:51,853 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:51,853 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-26 00:15:51,857 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 111 flow [2021-03-26 00:15:51,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 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:15:51,858 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:51,858 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:51,858 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:15:51,858 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:51,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:51,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1912883862, now seen corresponding path program 1 times [2021-03-26 00:15:51,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:51,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550230446] [2021-03-26 00:15:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:51,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:51,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:51,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:51,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:51,951 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:15:51,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550230446] [2021-03-26 00:15:51,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:51,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:51,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492141504] [2021-03-26 00:15:51,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:51,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:51,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:51,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:51,954 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-26 00:15:51,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 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:15:51,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:51,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-26 00:15:51,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:52,077 INFO L129 PetriNetUnfolder]: 419/791 cut-off events. [2021-03-26 00:15:52,077 INFO L130 PetriNetUnfolder]: For 132/142 co-relation queries the response was YES. [2021-03-26 00:15:52,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 791 events. 419/791 cut-off events. For 132/142 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 4895 event pairs, 194 based on Foata normal form. 52/686 useless extension candidates. Maximal degree in co-relation 1709. Up to 509 conditions per place. [2021-03-26 00:15:52,085 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 12 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2021-03-26 00:15:52,085 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 183 flow [2021-03-26 00:15:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:15:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:15:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 914 transitions. [2021-03-26 00:15:52,087 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8704761904761905 [2021-03-26 00:15:52,088 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 914 transitions. [2021-03-26 00:15:52,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 914 transitions. [2021-03-26 00:15:52,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:52,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 914 transitions. [2021-03-26 00:15:52,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 0 states have call successors, (0), 0 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:15:52,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:15:52,093 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:15:52,093 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 111 flow. Second operand 5 states and 914 transitions. [2021-03-26 00:15:52,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 183 flow [2021-03-26 00:15:52,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 177 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:52,096 INFO L241 Difference]: Finished difference. Result has 47 places, 40 transitions, 180 flow [2021-03-26 00:15:52,096 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2021-03-26 00:15:52,097 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -9 predicate places. [2021-03-26 00:15:52,097 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:52,097 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 180 flow [2021-03-26 00:15:52,097 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 40 transitions, 180 flow [2021-03-26 00:15:52,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 40 transitions, 180 flow [2021-03-26 00:15:52,146 INFO L129 PetriNetUnfolder]: 310/621 cut-off events. [2021-03-26 00:15:52,146 INFO L130 PetriNetUnfolder]: For 361/522 co-relation queries the response was YES. [2021-03-26 00:15:52,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 621 events. 310/621 cut-off events. For 361/522 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 3875 event pairs, 141 based on Foata normal form. 2/543 useless extension candidates. Maximal degree in co-relation 1741. Up to 399 conditions per place. [2021-03-26 00:15:52,155 INFO L142 LiptonReduction]: Number of co-enabled transitions 548 [2021-03-26 00:15:52,268 INFO L154 LiptonReduction]: Checked pairs total: 474 [2021-03-26 00:15:52,269 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:15:52,269 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 172 [2021-03-26 00:15:52,271 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 174 flow [2021-03-26 00:15:52,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 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:15:52,271 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:52,272 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:52,272 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:15:52,272 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:52,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1437231384, now seen corresponding path program 1 times [2021-03-26 00:15:52,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:52,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125031118] [2021-03-26 00:15:52,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:52,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:52,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:52,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:52,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:52,340 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:15:52,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125031118] [2021-03-26 00:15:52,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:52,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:15:52,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168140442] [2021-03-26 00:15:52,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:15:52,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:52,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:15:52,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:15:52,345 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-26 00:15:52,345 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 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:15:52,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:52,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-26 00:15:52,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:52,461 INFO L129 PetriNetUnfolder]: 284/578 cut-off events. [2021-03-26 00:15:52,462 INFO L130 PetriNetUnfolder]: For 549/1156 co-relation queries the response was YES. [2021-03-26 00:15:52,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1991 conditions, 578 events. 284/578 cut-off events. For 549/1156 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3226 event pairs, 50 based on Foata normal form. 98/617 useless extension candidates. Maximal degree in co-relation 1975. Up to 373 conditions per place. [2021-03-26 00:15:52,469 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 13 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2021-03-26 00:15:52,469 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 284 flow [2021-03-26 00:15:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:15:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:15:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1097 transitions. [2021-03-26 00:15:52,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8706349206349207 [2021-03-26 00:15:52,472 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1097 transitions. [2021-03-26 00:15:52,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1097 transitions. [2021-03-26 00:15:52,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:52,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1097 transitions. [2021-03-26 00:15:52,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 states have internal predecessors, (1097), 0 states have call successors, (0), 0 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:15:52,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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:15:52,479 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 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:15:52,479 INFO L185 Difference]: Start difference. First operand has 47 places, 39 transitions, 174 flow. Second operand 6 states and 1097 transitions. [2021-03-26 00:15:52,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 284 flow [2021-03-26 00:15:52,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 277 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:15:52,485 INFO L241 Difference]: Finished difference. Result has 51 places, 44 transitions, 263 flow [2021-03-26 00:15:52,485 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2021-03-26 00:15:52,485 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -5 predicate places. [2021-03-26 00:15:52,485 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:52,485 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 44 transitions, 263 flow [2021-03-26 00:15:52,485 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 263 flow [2021-03-26 00:15:52,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 263 flow [2021-03-26 00:15:52,524 INFO L129 PetriNetUnfolder]: 191/432 cut-off events. [2021-03-26 00:15:52,525 INFO L130 PetriNetUnfolder]: For 1042/1341 co-relation queries the response was YES. [2021-03-26 00:15:52,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 432 events. 191/432 cut-off events. For 1042/1341 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2522 event pairs, 46 based on Foata normal form. 14/423 useless extension candidates. Maximal degree in co-relation 1705. Up to 276 conditions per place. [2021-03-26 00:15:52,531 INFO L142 LiptonReduction]: Number of co-enabled transitions 626 [2021-03-26 00:15:52,625 INFO L154 LiptonReduction]: Checked pairs total: 530 [2021-03-26 00:15:52,626 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:15:52,626 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 141 [2021-03-26 00:15:52,628 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 255 flow [2021-03-26 00:15:52,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 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:15:52,628 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:52,628 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:52,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:15:52,628 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:52,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2001946782, now seen corresponding path program 1 times [2021-03-26 00:15:52,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:52,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694671397] [2021-03-26 00:15:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:52,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:52,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:52,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:52,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:52,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:52,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:52,754 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:15:52,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694671397] [2021-03-26 00:15:52,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:52,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:15:52,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85318700] [2021-03-26 00:15:52,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:15:52,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:52,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:15:52,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:15:52,757 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-26 00:15:52,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 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:15:52,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:52,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-26 00:15:52,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:52,853 INFO L129 PetriNetUnfolder]: 192/401 cut-off events. [2021-03-26 00:15:52,853 INFO L130 PetriNetUnfolder]: For 1132/1922 co-relation queries the response was YES. [2021-03-26 00:15:52,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 401 events. 192/401 cut-off events. For 1132/1922 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1960 event pairs, 16 based on Foata normal form. 103/459 useless extension candidates. Maximal degree in co-relation 1726. Up to 252 conditions per place. [2021-03-26 00:15:52,858 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 10 selfloop transitions, 18 changer transitions 4/55 dead transitions. [2021-03-26 00:15:52,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 411 flow [2021-03-26 00:15:52,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:15:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:15:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1280 transitions. [2021-03-26 00:15:52,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8707482993197279 [2021-03-26 00:15:52,861 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1280 transitions. [2021-03-26 00:15:52,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1280 transitions. [2021-03-26 00:15:52,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:52,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1280 transitions. [2021-03-26 00:15:52,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.85714285714286) internal successors, (1280), 7 states have internal predecessors, (1280), 0 states have call successors, (0), 0 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:15:52,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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:15:52,867 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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:15:52,867 INFO L185 Difference]: Start difference. First operand has 51 places, 43 transitions, 255 flow. Second operand 7 states and 1280 transitions. [2021-03-26 00:15:52,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 411 flow [2021-03-26 00:15:52,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 349 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 00:15:52,874 INFO L241 Difference]: Finished difference. Result has 54 places, 48 transitions, 315 flow [2021-03-26 00:15:52,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=315, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2021-03-26 00:15:52,875 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2021-03-26 00:15:52,875 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:52,875 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 315 flow [2021-03-26 00:15:52,875 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 315 flow [2021-03-26 00:15:52,876 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 315 flow [2021-03-26 00:15:52,898 INFO L129 PetriNetUnfolder]: 97/256 cut-off events. [2021-03-26 00:15:52,899 INFO L130 PetriNetUnfolder]: For 548/606 co-relation queries the response was YES. [2021-03-26 00:15:52,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 256 events. 97/256 cut-off events. For 548/606 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1258 event pairs, 18 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 963. Up to 136 conditions per place. [2021-03-26 00:15:52,902 INFO L142 LiptonReduction]: Number of co-enabled transitions 634 [2021-03-26 00:15:52,963 INFO L154 LiptonReduction]: Checked pairs total: 573 [2021-03-26 00:15:52,964 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:15:52,964 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 89 [2021-03-26 00:15:52,965 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 305 flow [2021-03-26 00:15:52,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 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:15:52,966 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:52,966 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:52,966 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:15:52,967 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:52,968 INFO L82 PathProgramCache]: Analyzing trace with hash -424206028, now seen corresponding path program 1 times [2021-03-26 00:15:52,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:52,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010105274] [2021-03-26 00:15:52,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:53,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:53,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,040 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:15:53,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010105274] [2021-03-26 00:15:53,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:53,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:53,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756904566] [2021-03-26 00:15:53,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:53,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:53,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:53,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:53,043 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 210 [2021-03-26 00:15:53,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 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:15:53,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:53,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 210 [2021-03-26 00:15:53,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:53,088 INFO L129 PetriNetUnfolder]: 125/315 cut-off events. [2021-03-26 00:15:53,088 INFO L130 PetriNetUnfolder]: For 607/646 co-relation queries the response was YES. [2021-03-26 00:15:53,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 315 events. 125/315 cut-off events. For 607/646 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1555 event pairs, 22 based on Foata normal form. 8/309 useless extension candidates. Maximal degree in co-relation 1130. Up to 153 conditions per place. [2021-03-26 00:15:53,091 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 4 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2021-03-26 00:15:53,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 279 flow [2021-03-26 00:15:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:15:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:15:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 747 transitions. [2021-03-26 00:15:53,093 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8892857142857142 [2021-03-26 00:15:53,093 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 747 transitions. [2021-03-26 00:15:53,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 747 transitions. [2021-03-26 00:15:53,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:53,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 747 transitions. [2021-03-26 00:15:53,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 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:15:53,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:15:53,097 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:15:53,097 INFO L185 Difference]: Start difference. First operand has 54 places, 47 transitions, 305 flow. Second operand 4 states and 747 transitions. [2021-03-26 00:15:53,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 279 flow [2021-03-26 00:15:53,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 238 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 00:15:53,102 INFO L241 Difference]: Finished difference. Result has 53 places, 44 transitions, 231 flow [2021-03-26 00:15:53,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2021-03-26 00:15:53,102 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2021-03-26 00:15:53,103 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:53,103 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 231 flow [2021-03-26 00:15:53,103 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 231 flow [2021-03-26 00:15:53,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 231 flow [2021-03-26 00:15:53,129 INFO L129 PetriNetUnfolder]: 125/307 cut-off events. [2021-03-26 00:15:53,129 INFO L130 PetriNetUnfolder]: For 362/372 co-relation queries the response was YES. [2021-03-26 00:15:53,130 INFO L84 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 307 events. 125/307 cut-off events. For 362/372 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1559 event pairs, 19 based on Foata normal form. 1/294 useless extension candidates. Maximal degree in co-relation 941. Up to 111 conditions per place. [2021-03-26 00:15:53,133 INFO L142 LiptonReduction]: Number of co-enabled transitions 558 [2021-03-26 00:15:53,172 INFO L154 LiptonReduction]: Checked pairs total: 313 [2021-03-26 00:15:53,172 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:15:53,172 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 69 [2021-03-26 00:15:53,173 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 234 flow [2021-03-26 00:15:53,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 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:15:53,174 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:53,175 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:53,175 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:15:53,175 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:53,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:53,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1536808358, now seen corresponding path program 2 times [2021-03-26 00:15:53,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:53,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690342112] [2021-03-26 00:15:53,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:53,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:53,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,265 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:15:53,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:15:53,279 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:15:53,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690342112] [2021-03-26 00:15:53,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:53,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:53,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375657965] [2021-03-26 00:15:53,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:53,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:53,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:53,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:53,282 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 211 [2021-03-26 00:15:53,282 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 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:15:53,282 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:53,282 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 211 [2021-03-26 00:15:53,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:53,372 INFO L129 PetriNetUnfolder]: 232/534 cut-off events. [2021-03-26 00:15:53,372 INFO L130 PetriNetUnfolder]: For 810/960 co-relation queries the response was YES. [2021-03-26 00:15:53,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1826 conditions, 534 events. 232/534 cut-off events. For 810/960 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3109 event pairs, 15 based on Foata normal form. 14/522 useless extension candidates. Maximal degree in co-relation 1806. Up to 202 conditions per place. [2021-03-26 00:15:53,377 INFO L132 encePairwiseOnDemand]: 202/211 looper letters, 13 selfloop transitions, 14 changer transitions 0/58 dead transitions. [2021-03-26 00:15:53,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 374 flow [2021-03-26 00:15:53,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:15:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:15:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 878 transitions. [2021-03-26 00:15:53,380 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8322274881516588 [2021-03-26 00:15:53,380 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 878 transitions. [2021-03-26 00:15:53,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 878 transitions. [2021-03-26 00:15:53,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:53,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 878 transitions. [2021-03-26 00:15:53,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.6) internal successors, (878), 5 states have internal predecessors, (878), 0 states have call successors, (0), 0 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:15:53,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 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:15:53,385 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 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:15:53,385 INFO L185 Difference]: Start difference. First operand has 53 places, 44 transitions, 234 flow. Second operand 5 states and 878 transitions. [2021-03-26 00:15:53,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 374 flow [2021-03-26 00:15:53,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 371 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:15:53,391 INFO L241 Difference]: Finished difference. Result has 59 places, 53 transitions, 347 flow [2021-03-26 00:15:53,391 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2021-03-26 00:15:53,392 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2021-03-26 00:15:53,392 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:53,392 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 347 flow [2021-03-26 00:15:53,392 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 53 transitions, 347 flow [2021-03-26 00:15:53,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 347 flow [2021-03-26 00:15:53,441 INFO L129 PetriNetUnfolder]: 231/558 cut-off events. [2021-03-26 00:15:53,441 INFO L130 PetriNetUnfolder]: For 824/909 co-relation queries the response was YES. [2021-03-26 00:15:53,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 558 events. 231/558 cut-off events. For 824/909 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3336 event pairs, 18 based on Foata normal form. 1/534 useless extension candidates. Maximal degree in co-relation 1906. Up to 208 conditions per place. [2021-03-26 00:15:53,450 INFO L142 LiptonReduction]: Number of co-enabled transitions 746 [2021-03-26 00:15:53,592 INFO L154 LiptonReduction]: Checked pairs total: 283 [2021-03-26 00:15:53,592 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:15:53,592 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 200 [2021-03-26 00:15:53,593 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 347 flow [2021-03-26 00:15:53,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 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:15:53,593 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:53,593 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:53,594 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:15:53,594 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:53,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1035845260, now seen corresponding path program 3 times [2021-03-26 00:15:53,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:53,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069377325] [2021-03-26 00:15:53,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:53,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:53,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:53,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:53,710 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:15:53,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069377325] [2021-03-26 00:15:53,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:53,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:15:53,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68722235] [2021-03-26 00:15:53,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:15:53,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:53,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:15:53,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:15:53,713 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 211 [2021-03-26 00:15:53,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 347 flow. Second operand has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 0 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:15:53,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:53,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 211 [2021-03-26 00:15:53,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:53,905 INFO L129 PetriNetUnfolder]: 499/960 cut-off events. [2021-03-26 00:15:53,905 INFO L130 PetriNetUnfolder]: For 1422/2078 co-relation queries the response was YES. [2021-03-26 00:15:53,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3600 conditions, 960 events. 499/960 cut-off events. For 1422/2078 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5816 event pairs, 18 based on Foata normal form. 130/962 useless extension candidates. Maximal degree in co-relation 3576. Up to 349 conditions per place. [2021-03-26 00:15:53,913 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 6 selfloop transitions, 18 changer transitions 7/62 dead transitions. [2021-03-26 00:15:53,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 461 flow [2021-03-26 00:15:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 00:15:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 00:15:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1463 transitions. [2021-03-26 00:15:53,916 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8667061611374408 [2021-03-26 00:15:53,917 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1463 transitions. [2021-03-26 00:15:53,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1463 transitions. [2021-03-26 00:15:53,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:53,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1463 transitions. [2021-03-26 00:15:53,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 182.875) internal successors, (1463), 8 states have internal predecessors, (1463), 0 states have call successors, (0), 0 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:15:53,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 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:15:53,925 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 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:15:53,925 INFO L185 Difference]: Start difference. First operand has 59 places, 53 transitions, 347 flow. Second operand 8 states and 1463 transitions. [2021-03-26 00:15:53,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 461 flow [2021-03-26 00:15:53,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 428 flow, removed 14 selfloop flow, removed 1 redundant places. [2021-03-26 00:15:53,935 INFO L241 Difference]: Finished difference. Result has 68 places, 52 transitions, 365 flow [2021-03-26 00:15:53,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=365, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2021-03-26 00:15:53,936 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2021-03-26 00:15:53,936 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:53,936 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 52 transitions, 365 flow [2021-03-26 00:15:53,936 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 52 transitions, 365 flow [2021-03-26 00:15:53,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 52 transitions, 365 flow [2021-03-26 00:15:53,974 INFO L129 PetriNetUnfolder]: 182/446 cut-off events. [2021-03-26 00:15:53,974 INFO L130 PetriNetUnfolder]: For 948/1019 co-relation queries the response was YES. [2021-03-26 00:15:53,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 446 events. 182/446 cut-off events. For 948/1019 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2632 event pairs, 10 based on Foata normal form. 2/426 useless extension candidates. Maximal degree in co-relation 1790. Up to 166 conditions per place. [2021-03-26 00:15:53,981 INFO L142 LiptonReduction]: Number of co-enabled transitions 650 [2021-03-26 00:15:54,348 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 00:15:54,506 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-26 00:15:54,624 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-26 00:15:54,911 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-26 00:15:55,065 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-26 00:15:55,082 INFO L154 LiptonReduction]: Checked pairs total: 1066 [2021-03-26 00:15:55,082 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:15:55,082 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1146 [2021-03-26 00:15:55,083 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 349 flow [2021-03-26 00:15:55,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 0 states have call successors, (0), 0 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:15:55,084 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:55,084 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:55,084 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:15:55,084 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:55,084 INFO L82 PathProgramCache]: Analyzing trace with hash 63765893, now seen corresponding path program 1 times [2021-03-26 00:15:55,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:55,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544353480] [2021-03-26 00:15:55,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:55,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:55,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:55,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:55,151 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:15:55,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544353480] [2021-03-26 00:15:55,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:55,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:15:55,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701741196] [2021-03-26 00:15:55,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:15:55,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:55,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:15:55,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:15:55,153 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 213 [2021-03-26 00:15:55,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 349 flow. Second operand has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 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:15:55,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:55,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 213 [2021-03-26 00:15:55,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:55,236 INFO L129 PetriNetUnfolder]: 295/686 cut-off events. [2021-03-26 00:15:55,236 INFO L130 PetriNetUnfolder]: For 2684/2911 co-relation queries the response was YES. [2021-03-26 00:15:55,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 686 events. 295/686 cut-off events. For 2684/2911 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4537 event pairs, 17 based on Foata normal form. 27/679 useless extension candidates. Maximal degree in co-relation 2682. Up to 238 conditions per place. [2021-03-26 00:15:55,242 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 4 selfloop transitions, 1 changer transitions 11/53 dead transitions. [2021-03-26 00:15:55,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 53 transitions, 402 flow [2021-03-26 00:15:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:15:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:15:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 742 transitions. [2021-03-26 00:15:55,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8708920187793427 [2021-03-26 00:15:55,245 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 742 transitions. [2021-03-26 00:15:55,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 742 transitions. [2021-03-26 00:15:55,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:55,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 742 transitions. [2021-03-26 00:15:55,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.5) internal successors, (742), 4 states have internal predecessors, (742), 0 states have call successors, (0), 0 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:15:55,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:55,249 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:15:55,249 INFO L185 Difference]: Start difference. First operand has 64 places, 49 transitions, 349 flow. Second operand 4 states and 742 transitions. [2021-03-26 00:15:55,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 53 transitions, 402 flow [2021-03-26 00:15:55,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 336 flow, removed 15 selfloop flow, removed 9 redundant places. [2021-03-26 00:15:55,260 INFO L241 Difference]: Finished difference. Result has 60 places, 42 transitions, 237 flow [2021-03-26 00:15:55,260 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2021-03-26 00:15:55,260 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2021-03-26 00:15:55,261 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:55,261 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 42 transitions, 237 flow [2021-03-26 00:15:55,261 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 42 transitions, 237 flow [2021-03-26 00:15:55,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 42 transitions, 237 flow [2021-03-26 00:15:55,281 INFO L129 PetriNetUnfolder]: 110/261 cut-off events. [2021-03-26 00:15:55,281 INFO L130 PetriNetUnfolder]: For 362/391 co-relation queries the response was YES. [2021-03-26 00:15:55,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 261 events. 110/261 cut-off events. For 362/391 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1307 event pairs, 7 based on Foata normal form. 7/248 useless extension candidates. Maximal degree in co-relation 779. Up to 86 conditions per place. [2021-03-26 00:15:55,285 INFO L142 LiptonReduction]: Number of co-enabled transitions 424 [2021-03-26 00:15:55,490 INFO L154 LiptonReduction]: Checked pairs total: 183 [2021-03-26 00:15:55,490 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:15:55,490 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 230 [2021-03-26 00:15:55,491 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 235 flow [2021-03-26 00:15:55,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 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:15:55,491 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:55,492 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:55,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:15:55,492 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:55,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:55,492 INFO L82 PathProgramCache]: Analyzing trace with hash 386443452, now seen corresponding path program 1 times [2021-03-26 00:15:55,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:55,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808013443] [2021-03-26 00:15:55,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:15:55,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:15:55,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:55,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:15:55,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:15:55,570 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 00:15:55,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:15:55,582 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:15:55,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808013443] [2021-03-26 00:15:55,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:15:55,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:15:55,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319726025] [2021-03-26 00:15:55,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:15:55,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:15:55,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:15:55,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:15:55,585 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 215 [2021-03-26 00:15:55,586 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 0 states have call successors, (0), 0 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:15:55,586 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:15:55,586 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 215 [2021-03-26 00:15:55,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:15:55,660 INFO L129 PetriNetUnfolder]: 143/310 cut-off events. [2021-03-26 00:15:55,660 INFO L130 PetriNetUnfolder]: For 645/679 co-relation queries the response was YES. [2021-03-26 00:15:55,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 310 events. 143/310 cut-off events. For 645/679 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1608 event pairs, 2 based on Foata normal form. 23/309 useless extension candidates. Maximal degree in co-relation 992. Up to 102 conditions per place. [2021-03-26 00:15:55,662 INFO L132 encePairwiseOnDemand]: 209/215 looper letters, 9 selfloop transitions, 6 changer transitions 3/46 dead transitions. [2021-03-26 00:15:55,662 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 46 transitions, 319 flow [2021-03-26 00:15:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:15:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:15:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1043 transitions. [2021-03-26 00:15:55,666 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8085271317829458 [2021-03-26 00:15:55,666 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1043 transitions. [2021-03-26 00:15:55,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1043 transitions. [2021-03-26 00:15:55,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:15:55,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1043 transitions. [2021-03-26 00:15:55,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.83333333333334) internal successors, (1043), 6 states have internal predecessors, (1043), 0 states have call successors, (0), 0 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:15:55,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:15:55,671 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 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:15:55,671 INFO L185 Difference]: Start difference. First operand has 58 places, 41 transitions, 235 flow. Second operand 6 states and 1043 transitions. [2021-03-26 00:15:55,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 46 transitions, 319 flow [2021-03-26 00:15:55,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 46 transitions, 307 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 00:15:55,678 INFO L241 Difference]: Finished difference. Result has 61 places, 41 transitions, 240 flow [2021-03-26 00:15:55,678 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2021-03-26 00:15:55,678 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2021-03-26 00:15:55,678 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:15:55,678 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 41 transitions, 240 flow [2021-03-26 00:15:55,678 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 41 transitions, 240 flow [2021-03-26 00:15:55,679 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 41 transitions, 240 flow [2021-03-26 00:15:55,706 INFO L129 PetriNetUnfolder]: 133/295 cut-off events. [2021-03-26 00:15:55,707 INFO L130 PetriNetUnfolder]: For 449/482 co-relation queries the response was YES. [2021-03-26 00:15:55,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 295 events. 133/295 cut-off events. For 449/482 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1575 event pairs, 9 based on Foata normal form. 6/277 useless extension candidates. Maximal degree in co-relation 894. Up to 96 conditions per place. [2021-03-26 00:15:55,711 INFO L142 LiptonReduction]: Number of co-enabled transitions 386 [2021-03-26 00:15:55,861 INFO L154 LiptonReduction]: Checked pairs total: 127 [2021-03-26 00:15:55,861 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:15:55,862 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 184 [2021-03-26 00:15:55,862 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 238 flow [2021-03-26 00:15:55,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 0 states have call successors, (0), 0 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:15:55,863 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:15:55,863 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:15:55,863 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:15:55,863 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:15:55,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:15:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1965187680, now seen corresponding path program 1 times [2021-03-26 00:15:55,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:15:55,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329103199] [2021-03-26 00:15:55,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:15:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:15:55,908 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:15:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:15:55,963 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:15:56,008 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:15:56,009 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:15:56,010 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:15:56,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:15:56 BasicIcfg [2021-03-26 00:15:56,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:15:56,117 INFO L168 Benchmark]: Toolchain (without parser) took 14009.86 ms. Allocated memory was 255.9 MB in the beginning and 725.6 MB in the end (delta: 469.8 MB). Free memory was 235.0 MB in the beginning and 544.8 MB in the end (delta: -309.8 MB). Peak memory consumption was 158.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:15:56,118 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 160.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:15:56,118 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.70 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 235.0 MB in the beginning and 319.7 MB in the end (delta: -84.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:15:56,118 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.06 ms. Allocated memory is still 360.7 MB. Free memory was 319.0 MB in the beginning and 316.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:15:56,118 INFO L168 Benchmark]: Boogie Preprocessor took 32.98 ms. Allocated memory is still 360.7 MB. Free memory was 316.9 MB in the beginning and 314.8 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:15:56,119 INFO L168 Benchmark]: RCFGBuilder took 1620.80 ms. Allocated memory is still 360.7 MB. Free memory was 314.8 MB in the beginning and 319.4 MB in the end (delta: -4.6 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:15:56,119 INFO L168 Benchmark]: TraceAbstraction took 11693.91 ms. Allocated memory was 360.7 MB in the beginning and 725.6 MB in the end (delta: 364.9 MB). Free memory was 319.4 MB in the beginning and 544.8 MB in the end (delta: -225.4 MB). Peak memory consumption was 138.5 MB. Max. memory is 16.0 GB. [2021-03-26 00:15:56,120 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.47 ms. Allocated memory is still 255.9 MB. Free memory was 237.7 MB in the beginning and 237.5 MB in the end (delta: 160.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 602.70 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 235.0 MB in the beginning and 319.7 MB in the end (delta: -84.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.06 ms. Allocated memory is still 360.7 MB. Free memory was 319.0 MB in the beginning and 316.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 32.98 ms. Allocated memory is still 360.7 MB. Free memory was 316.9 MB in the beginning and 314.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1620.80 ms. Allocated memory is still 360.7 MB. Free memory was 314.8 MB in the beginning and 319.4 MB in the end (delta: -4.6 MB). Peak memory consumption was 63.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11693.91 ms. Allocated memory was 360.7 MB in the beginning and 725.6 MB in the end (delta: 364.9 MB). Free memory was 319.4 MB in the beginning and 544.8 MB in the end (delta: -225.4 MB). Peak memory consumption was 138.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3466.2ms, 126 PlacesBefore, 56 PlacesAfterwards, 115 TransitionsBefore, 44 TransitionsAfterwards, 2610 CoEnabledTransitionPairs, 5 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 3943 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2315, positive: 2228, positive conditional: 2228, 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: 1818, positive: 1781, positive conditional: 0, positive unconditional: 1781, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1818, positive: 1781, positive conditional: 0, positive unconditional: 1781, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1818, positive: 1781, positive conditional: 0, positive unconditional: 1781, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 386, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 386, negative conditional: 0, negative unconditional: 386, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2315, positive: 447, positive conditional: 447, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 1818, unknown conditional: 1818, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 135, Positive conditional cache size: 135, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2736.4ms, 52 PlacesBefore, 39 PlacesAfterwards, 41 TransitionsBefore, 28 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 2625 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 710, positive: 571, positive conditional: 571, positive unconditional: 0, negative: 139, negative conditional: 139, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, positive: 154, positive conditional: 24, positive unconditional: 130, negative: 25, negative conditional: 6, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 179, positive: 154, positive conditional: 24, positive unconditional: 130, negative: 25, negative conditional: 6, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 179, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 25, negative conditional: 6, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 311, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 296, negative conditional: 157, negative unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 710, positive: 417, positive conditional: 417, positive unconditional: 0, negative: 114, negative conditional: 114, negative unconditional: 0, unknown: 179, unknown conditional: 179, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 174, Positive conditional cache size: 174, 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: 83.7ms, 43 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 213 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 23, positive conditional: 1, positive unconditional: 22, negative: 5, negative conditional: 1, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 23, positive conditional: 1, positive unconditional: 22, negative: 5, negative conditional: 1, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 23, positive conditional: 0, positive unconditional: 23, 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: 1, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 48, negative conditional: 4, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 197, Positive conditional cache size: 197, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.7ms, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 253 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 99, positive: 86, positive conditional: 86, 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: 21, positive: 20, positive conditional: 12, positive unconditional: 8, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 12, positive unconditional: 8, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 217, Positive conditional cache size: 217, 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: 171.7ms, 47 PlacesBefore, 47 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 474 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 228, positive: 210, positive conditional: 210, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 44, positive conditional: 32, positive unconditional: 12, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, positive: 44, positive conditional: 32, positive unconditional: 12, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 228, positive: 166, positive conditional: 166, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 45, unknown conditional: 45, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 223, Positive conditional cache size: 223, 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: 140.2ms, 51 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 530 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 264, positive: 246, positive conditional: 246, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 51, positive conditional: 37, positive unconditional: 14, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, positive: 51, positive conditional: 37, positive unconditional: 14, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 72, negative conditional: 40, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 264, positive: 195, positive conditional: 195, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 53, unknown conditional: 53, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 260, Positive conditional cache size: 260, Positive unconditional cache size: 0, Negative cache size: 45, Negative conditional cache size: 45, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.4ms, 54 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 573 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 178, positive: 158, positive conditional: 158, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 35, positive conditional: 23, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, positive: 35, positive conditional: 23, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, positive: 123, positive conditional: 123, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 278, Positive conditional cache size: 278, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 69.0ms, 53 PlacesBefore, 53 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 313 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 122, positive: 110, positive conditional: 110, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 51, positive conditional: 26, positive unconditional: 25, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, positive: 51, positive conditional: 26, positive unconditional: 25, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 52, unknown conditional: 52, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 298, Positive conditional cache size: 298, 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: 200.0ms, 59 PlacesBefore, 59 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 283 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 71, positive conditional: 71, 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: 23, positive: 19, positive conditional: 12, positive unconditional: 7, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 19, positive conditional: 12, positive unconditional: 7, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 122, negative conditional: 41, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 317, Positive conditional cache size: 317, 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: 1146.0ms, 68 PlacesBefore, 64 PlacesAfterwards, 52 TransitionsBefore, 49 TransitionsAfterwards, 650 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1066 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 300, positive: 258, positive conditional: 258, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, positive: 35, positive conditional: 0, positive unconditional: 35, 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: 300, positive: 223, positive conditional: 223, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 298, Positive conditional cache size: 298, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 229.2ms, 60 PlacesBefore, 58 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 183 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 14, positive unconditional: 11, 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: 25, positive: 25, positive conditional: 14, positive unconditional: 11, 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: 25, positive: 25, positive conditional: 0, positive unconditional: 25, 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: 49, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 201, Positive conditional cache size: 201, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 183.0ms, 61 PlacesBefore, 60 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 127 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 161, Positive conditional cache size: 161, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L731] 0 _Bool y$flush_delayed; [L732] 0 int y$mem_tmp; [L733] 0 _Bool y$r_buff0_thd0; [L734] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$r_buff0_thd2; [L736] 0 _Bool y$r_buff0_thd3; [L737] 0 _Bool y$r_buff0_thd4; [L738] 0 _Bool y$r_buff1_thd0; [L739] 0 _Bool y$r_buff1_thd1; [L740] 0 _Bool y$r_buff1_thd2; [L741] 0 _Bool y$r_buff1_thd3; [L742] 0 _Bool y$r_buff1_thd4; [L743] 0 _Bool y$read_delayed; [L744] 0 int *y$read_delayed_var; [L745] 0 int y$w_buff0; [L746] 0 _Bool y$w_buff0_used; [L747] 0 int y$w_buff1; [L748] 0 _Bool y$w_buff1_used; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L863] 0 pthread_t t941; [L864] FCALL, FORK 0 pthread_create(&t941, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L865] 0 pthread_t t942; [L866] FCALL, FORK 0 pthread_create(&t942, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L867] 0 pthread_t t943; [L868] FCALL, FORK 0 pthread_create(&t943, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L869] 0 pthread_t t944; [L870] FCALL, FORK 0 pthread_create(&t944, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1 = y$w_buff0 [L800] 3 y$w_buff0 = 1 [L801] 3 y$w_buff1_used = y$w_buff0_used [L802] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L804] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L805] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L806] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L807] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L808] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L809] 3 y$r_buff0_thd3 = (_Bool)1 [L812] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 4 z = 1 [L832] 4 a = 1 [L835] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L838] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EAX = y [L786] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 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) [L815] 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) [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 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 [L818] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L819] 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 [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L876] 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) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] 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) [L876] 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) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L878] 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 [L879] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L880] 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 [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11452.5ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1345.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3571.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 73 SDtfs, 55 SDslu, 48 SDs, 0 SdLazy, 246 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 250.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 192.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=9, InterpolantAutomatonStates: 56, 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: 41.0ms SsaConstructionTime, 436.3ms SatisfiabilityAnalysisTime, 651.9ms InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 1113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...