/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:49:08,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:49:08,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:49:08,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:49:08,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:49:08,138 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:49:08,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:49:08,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:49:08,141 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:49:08,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:49:08,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:49:08,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:49:08,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:49:08,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:49:08,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:49:08,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:49:08,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:49:08,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:49:08,162 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:49:08,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:49:08,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:49:08,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:49:08,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:49:08,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:49:08,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:49:08,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:49:08,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:49:08,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:49:08,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:49:08,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:49:08,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:49:08,177 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:49:08,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:49:08,178 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:49:08,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:49:08,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:49:08,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:49:08,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:49:08,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:49:08,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:49:08,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:49:08,183 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-RepeatedSemanticLbe.epf [2021-03-25 14:49:08,211 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:49:08,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:49:08,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:49:08,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:49:08,212 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:49:08,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:49:08,212 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:49:08,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:49:08,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:49:08,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:49:08,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:49:08,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:49:08,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:49:08,213 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:49:08,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:49:08,213 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:49:08,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:49:08,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:49:08,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:49:08,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:49:08,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:49:08,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:49:08,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:49:08,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:49:08,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:49:08,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:49:08,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:49:08,214 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:49:08,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:49:08,214 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:49:08,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:49:08,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:49:08,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:49:08,445 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:49:08,446 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:49:08,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2021-03-25 14:49:08,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da918268/e48427bac92f42f083b502ae36c91769/FLAGa0168e201 [2021-03-25 14:49:08,917 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:49:08,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_pso.opt.i [2021-03-25 14:49:08,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da918268/e48427bac92f42f083b502ae36c91769/FLAGa0168e201 [2021-03-25 14:49:09,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da918268/e48427bac92f42f083b502ae36c91769 [2021-03-25 14:49:09,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:49:09,240 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:49:09,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:49:09,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:49:09,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:49:09,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46265896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09, skipping insertion in model container [2021-03-25 14:49:09,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,250 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:49:09,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:49:09,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/safe004_pso.opt.i[949,962] [2021-03-25 14:49:09,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:49:09,498 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:49:09,505 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/safe004_pso.opt.i[949,962] [2021-03-25 14:49:09,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:49:09,579 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:49:09,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09 WrapperNode [2021-03-25 14:49:09,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:49:09,581 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:49:09,582 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:49:09,582 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:49:09,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:49:09,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:49:09,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:49:09,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:49:09,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (1/1) ... [2021-03-25 14:49:09,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:49:09,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:49:09,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:49:09,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:49:09,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:49:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:49:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:49:09,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:49:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:49:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:49:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:49:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:49:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:49:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:49:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:49:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:49:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:49:09,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:49:09,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:49:09,684 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:49:10,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:49:10,946 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:49:10,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:49:10 BoogieIcfgContainer [2021-03-25 14:49:10,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:49:10,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:49:10,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:49:10,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:49:10,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:49:09" (1/3) ... [2021-03-25 14:49:10,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1579da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:49:10, skipping insertion in model container [2021-03-25 14:49:10,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:49:09" (2/3) ... [2021-03-25 14:49:10,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1579da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:49:10, skipping insertion in model container [2021-03-25 14:49:10,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:49:10" (3/3) ... [2021-03-25 14:49:10,953 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_pso.opt.i [2021-03-25 14:49:10,956 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:49:10,959 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:49:10,959 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:49:10,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,984 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,984 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,987 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,987 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,987 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,987 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,989 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,991 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,991 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,992 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,992 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:10,999 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,001 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,002 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,005 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,005 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,005 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:49:11,006 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:49:11,017 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:49:11,032 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:49:11,032 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:49:11,032 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:49:11,032 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:49:11,032 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:49:11,032 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:49:11,032 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:49:11,032 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:49:11,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 14:49:11,063 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 14:49:11,063 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:49:11,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:49:11,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 14:49:11,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-25 14:49:11,069 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:11,076 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 14:49:11,078 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 14:49:11,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-25 14:49:11,090 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 14:49:11,090 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:49:11,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:49:11,093 INFO L142 LiptonReduction]: Number of co-enabled transitions 1686 [2021-03-25 14:49:12,673 WARN L205 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 14:49:13,191 WARN L205 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-25 14:49:14,443 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 14:49:14,955 WARN L205 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:49:15,112 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:49:15,459 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 14:49:15,592 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:49:16,518 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:49:16,789 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:49:17,335 WARN L205 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:49:17,944 WARN L205 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:49:18,057 INFO L154 LiptonReduction]: Checked pairs total: 2882 [2021-03-25 14:49:18,057 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-25 14:49:18,058 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6990 [2021-03-25 14:49:18,073 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-25 14:49:18,074 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:49:18,074 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:18,074 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:18,074 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:18,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash 788348067, now seen corresponding path program 1 times [2021-03-25 14:49:18,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:18,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818605705] [2021-03-25 14:49:18,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:18,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:18,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:49:18,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:18,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:18,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818605705] [2021-03-25 14:49:18,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:18,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:49:18,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847908454] [2021-03-25 14:49:18,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:49:18,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:18,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:49:18,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:49:18,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2021-03-25 14:49:18,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:18,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:18,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2021-03-25 14:49:18,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:18,351 INFO L129 PetriNetUnfolder]: 69/198 cut-off events. [2021-03-25 14:49:18,351 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:49:18,353 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 198 events. 69/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 921 event pairs, 39 based on Foata normal form. 11/192 useless extension candidates. Maximal degree in co-relation 307. Up to 89 conditions per place. [2021-03-25 14:49:18,354 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2021-03-25 14:49:18,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-25 14:49:18,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:49:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:49:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2021-03-25 14:49:18,368 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902691511387164 [2021-03-25 14:49:18,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2021-03-25 14:49:18,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2021-03-25 14:49:18,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:18,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2021-03-25 14:49:18,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:18,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:18,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:18,388 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 430 transitions. [2021-03-25 14:49:18,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-25 14:49:18,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:49:18,392 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-25 14:49:18,393 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-25 14:49:18,393 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-25 14:49:18,393 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:18,393 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 14:49:18,394 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 14:49:18,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-25 14:49:18,398 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 14:49:18,398 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:49:18,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:49:18,399 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-25 14:49:18,830 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:49:19,134 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:49:19,714 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:49:20,288 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:49:20,889 INFO L154 LiptonReduction]: Checked pairs total: 1242 [2021-03-25 14:49:20,889 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-25 14:49:20,890 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2497 [2021-03-25 14:49:20,890 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-25 14:49:20,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:20,891 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:20,891 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:20,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:49:20,891 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1851944499, now seen corresponding path program 1 times [2021-03-25 14:49:20,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:20,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081489013] [2021-03-25 14:49:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:20,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:20,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:49:20,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:20,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:20,998 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:49:20,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:49:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:21,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081489013] [2021-03-25 14:49:21,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:21,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:49:21,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653557870] [2021-03-25 14:49:21,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:49:21,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:21,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:49:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:49:21,004 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 169 [2021-03-25 14:49:21,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:21,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:21,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 169 [2021-03-25 14:49:21,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:21,031 INFO L129 PetriNetUnfolder]: 21/78 cut-off events. [2021-03-25 14:49:21,032 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:49:21,032 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 78 events. 21/78 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 274 event pairs, 11 based on Foata normal form. 1/75 useless extension candidates. Maximal degree in co-relation 120. Up to 40 conditions per place. [2021-03-25 14:49:21,032 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 7 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-25 14:49:21,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 86 flow [2021-03-25 14:49:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:49:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:49:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2021-03-25 14:49:21,034 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8500986193293886 [2021-03-25 14:49:21,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2021-03-25 14:49:21,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2021-03-25 14:49:21,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:21,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2021-03-25 14:49:21,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:21,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:21,037 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:21,037 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 431 transitions. [2021-03-25 14:49:21,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 86 flow [2021-03-25 14:49:21,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:49:21,038 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 73 flow [2021-03-25 14:49:21,039 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-03-25 14:49:21,039 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-25 14:49:21,039 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:21,039 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-25 14:49:21,040 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-25 14:49:21,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 73 flow [2021-03-25 14:49:21,044 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-25 14:49:21,044 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:49:21,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 3/36 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-25 14:49:21,045 INFO L142 LiptonReduction]: Number of co-enabled transitions 270 [2021-03-25 14:49:21,552 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 14:49:21,672 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 14:49:21,940 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 14:49:22,062 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 14:49:22,065 INFO L154 LiptonReduction]: Checked pairs total: 780 [2021-03-25 14:49:22,065 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:49:22,065 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1026 [2021-03-25 14:49:22,066 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 69 flow [2021-03-25 14:49:22,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,066 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:22,066 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:22,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:49:22,066 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:22,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:22,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1193503231, now seen corresponding path program 1 times [2021-03-25 14:49:22,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:22,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222693806] [2021-03-25 14:49:22,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:22,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:22,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222693806] [2021-03-25 14:49:22,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:22,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:49:22,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206437407] [2021-03-25 14:49:22,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:49:22,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:22,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:49:22,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:49:22,129 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 171 [2021-03-25 14:49:22,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:22,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 171 [2021-03-25 14:49:22,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:22,138 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-25 14:49:22,139 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 14:49:22,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 32 events. 3/32 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-25 14:49:22,139 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-25 14:49:22,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 75 flow [2021-03-25 14:49:22,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:49:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:49:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-25 14:49:22,140 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8966861598440545 [2021-03-25 14:49:22,140 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-25 14:49:22,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-25 14:49:22,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:22,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-25 14:49:22,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,143 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 460 transitions. [2021-03-25 14:49:22,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 75 flow [2021-03-25 14:49:22,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:49:22,144 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 74 flow [2021-03-25 14:49:22,144 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-03-25 14:49:22,144 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-25 14:49:22,144 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:22,144 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 74 flow [2021-03-25 14:49:22,145 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 74 flow [2021-03-25 14:49:22,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 74 flow [2021-03-25 14:49:22,148 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-25 14:49:22,148 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 14:49:22,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-25 14:49:22,148 INFO L142 LiptonReduction]: Number of co-enabled transitions 268 [2021-03-25 14:49:22,149 INFO L154 LiptonReduction]: Checked pairs total: 246 [2021-03-25 14:49:22,149 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:49:22,149 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-03-25 14:49:22,150 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 74 flow [2021-03-25 14:49:22,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,150 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:22,150 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:22,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:49:22,151 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:22,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:22,151 INFO L82 PathProgramCache]: Analyzing trace with hash 510325772, now seen corresponding path program 1 times [2021-03-25 14:49:22,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:22,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878218855] [2021-03-25 14:49:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:22,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:22,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878218855] [2021-03-25 14:49:22,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:22,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:49:22,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599754511] [2021-03-25 14:49:22,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:49:22,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:22,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:49:22,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:49:22,216 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 171 [2021-03-25 14:49:22,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:22,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 171 [2021-03-25 14:49:22,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:22,225 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-03-25 14:49:22,225 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-25 14:49:22,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 32 events. 3/32 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-25 14:49:22,226 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-25 14:49:22,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 24 transitions, 80 flow [2021-03-25 14:49:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:49:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:49:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-25 14:49:22,227 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8966861598440545 [2021-03-25 14:49:22,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-25 14:49:22,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-25 14:49:22,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:22,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-25 14:49:22,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,230 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 74 flow. Second operand 3 states and 460 transitions. [2021-03-25 14:49:22,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 24 transitions, 80 flow [2021-03-25 14:49:22,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 24 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:49:22,231 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 78 flow [2021-03-25 14:49:22,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-25 14:49:22,231 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -13 predicate places. [2021-03-25 14:49:22,231 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:22,231 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 78 flow [2021-03-25 14:49:22,232 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 78 flow [2021-03-25 14:49:22,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 24 transitions, 78 flow [2021-03-25 14:49:22,235 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-25 14:49:22,235 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-25 14:49:22,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 34 events. 3/34 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2021-03-25 14:49:22,237 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-25 14:49:22,238 INFO L154 LiptonReduction]: Checked pairs total: 244 [2021-03-25 14:49:22,238 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:49:22,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 14:49:22,240 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 78 flow [2021-03-25 14:49:22,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,241 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:22,241 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:22,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:49:22,241 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:22,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2015421001, now seen corresponding path program 1 times [2021-03-25 14:49:22,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:22,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797955071] [2021-03-25 14:49:22,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:22,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:22,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:22,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797955071] [2021-03-25 14:49:22,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:22,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:49:22,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411279868] [2021-03-25 14:49:22,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:49:22,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:22,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:49:22,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:49:22,305 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-25 14:49:22,306 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:22,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-25 14:49:22,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:22,328 INFO L129 PetriNetUnfolder]: 10/61 cut-off events. [2021-03-25 14:49:22,328 INFO L130 PetriNetUnfolder]: For 35/57 co-relation queries the response was YES. [2021-03-25 14:49:22,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 61 events. 10/61 cut-off events. For 35/57 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 227 event pairs, 1 based on Foata normal form. 7/67 useless extension candidates. Maximal degree in co-relation 127. Up to 20 conditions per place. [2021-03-25 14:49:22,328 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 7 selfloop transitions, 4 changer transitions 1/28 dead transitions. [2021-03-25 14:49:22,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 118 flow [2021-03-25 14:49:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:49:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:49:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2021-03-25 14:49:22,330 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8377192982456141 [2021-03-25 14:49:22,330 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2021-03-25 14:49:22,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2021-03-25 14:49:22,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:22,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2021-03-25 14:49:22,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,333 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,333 INFO L185 Difference]: Start difference. First operand has 35 places, 24 transitions, 78 flow. Second operand 4 states and 573 transitions. [2021-03-25 14:49:22,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 118 flow [2021-03-25 14:49:22,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 107 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 14:49:22,334 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 83 flow [2021-03-25 14:49:22,334 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2021-03-25 14:49:22,334 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -12 predicate places. [2021-03-25 14:49:22,335 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:22,335 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 24 transitions, 83 flow [2021-03-25 14:49:22,335 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 24 transitions, 83 flow [2021-03-25 14:49:22,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 24 transitions, 83 flow [2021-03-25 14:49:22,338 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-25 14:49:22,338 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-25 14:49:22,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 37 events. 3/37 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 62. Up to 10 conditions per place. [2021-03-25 14:49:22,339 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-25 14:49:22,340 INFO L154 LiptonReduction]: Checked pairs total: 225 [2021-03-25 14:49:22,340 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:49:22,340 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-03-25 14:49:22,340 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 83 flow [2021-03-25 14:49:22,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,341 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:22,341 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:22,341 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:49:22,341 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2069532121, now seen corresponding path program 2 times [2021-03-25 14:49:22,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:22,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112991200] [2021-03-25 14:49:22,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:22,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:49:22,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:22,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:22,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112991200] [2021-03-25 14:49:22,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:22,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:49:22,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997563577] [2021-03-25 14:49:22,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:49:22,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:22,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:49:22,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:49:22,399 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-25 14:49:22,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:22,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-25 14:49:22,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:22,429 INFO L129 PetriNetUnfolder]: 6/66 cut-off events. [2021-03-25 14:49:22,429 INFO L130 PetriNetUnfolder]: For 39/41 co-relation queries the response was YES. [2021-03-25 14:49:22,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 66 events. 6/66 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 270 event pairs, 2 based on Foata normal form. 5/70 useless extension candidates. Maximal degree in co-relation 127. Up to 15 conditions per place. [2021-03-25 14:49:22,429 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 7 selfloop transitions, 4 changer transitions 2/29 dead transitions. [2021-03-25 14:49:22,429 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 133 flow [2021-03-25 14:49:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:49:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:49:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 714 transitions. [2021-03-25 14:49:22,431 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8350877192982457 [2021-03-25 14:49:22,431 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 714 transitions. [2021-03-25 14:49:22,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 714 transitions. [2021-03-25 14:49:22,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:22,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 714 transitions. [2021-03-25 14:49:22,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,435 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,436 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 83 flow. Second operand 5 states and 714 transitions. [2021-03-25 14:49:22,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 133 flow [2021-03-25 14:49:22,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 119 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 14:49:22,437 INFO L241 Difference]: Finished difference. Result has 41 places, 26 transitions, 109 flow [2021-03-25 14:49:22,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2021-03-25 14:49:22,438 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -7 predicate places. [2021-03-25 14:49:22,438 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:22,438 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 109 flow [2021-03-25 14:49:22,438 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 109 flow [2021-03-25 14:49:22,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 109 flow [2021-03-25 14:49:22,443 INFO L129 PetriNetUnfolder]: 2/42 cut-off events. [2021-03-25 14:49:22,443 INFO L130 PetriNetUnfolder]: For 26/27 co-relation queries the response was YES. [2021-03-25 14:49:22,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 42 events. 2/42 cut-off events. For 26/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 113 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 78. Up to 10 conditions per place. [2021-03-25 14:49:22,445 INFO L142 LiptonReduction]: Number of co-enabled transitions 260 [2021-03-25 14:49:22,625 INFO L154 LiptonReduction]: Checked pairs total: 277 [2021-03-25 14:49:22,625 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:49:22,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 187 [2021-03-25 14:49:22,626 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 109 flow [2021-03-25 14:49:22,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:22,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:22,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:49:22,626 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:22,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash -205884364, now seen corresponding path program 1 times [2021-03-25 14:49:22,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:22,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624816309] [2021-03-25 14:49:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:22,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:22,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:22,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:22,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624816309] [2021-03-25 14:49:22,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:22,695 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:49:22,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994851303] [2021-03-25 14:49:22,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:49:22,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:22,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:49:22,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:49:22,697 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-25 14:49:22,697 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,697 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:22,697 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-25 14:49:22,697 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:22,720 INFO L129 PetriNetUnfolder]: 4/69 cut-off events. [2021-03-25 14:49:22,721 INFO L130 PetriNetUnfolder]: For 72/74 co-relation queries the response was YES. [2021-03-25 14:49:22,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 69 events. 4/69 cut-off events. For 72/74 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 298 event pairs, 0 based on Foata normal form. 5/73 useless extension candidates. Maximal degree in co-relation 155. Up to 17 conditions per place. [2021-03-25 14:49:22,721 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 7 selfloop transitions, 4 changer transitions 3/30 dead transitions. [2021-03-25 14:49:22,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 161 flow [2021-03-25 14:49:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:49:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:49:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2021-03-25 14:49:22,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8377192982456141 [2021-03-25 14:49:22,723 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2021-03-25 14:49:22,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2021-03-25 14:49:22,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:22,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2021-03-25 14:49:22,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,726 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,726 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 109 flow. Second operand 4 states and 573 transitions. [2021-03-25 14:49:22,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 161 flow [2021-03-25 14:49:22,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 137 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-25 14:49:22,728 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 106 flow [2021-03-25 14:49:22,728 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2021-03-25 14:49:22,729 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-25 14:49:22,729 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:22,729 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 106 flow [2021-03-25 14:49:22,729 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 106 flow [2021-03-25 14:49:22,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 106 flow [2021-03-25 14:49:22,735 INFO L129 PetriNetUnfolder]: 2/43 cut-off events. [2021-03-25 14:49:22,735 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-03-25 14:49:22,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 43 events. 2/43 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 117 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 77. Up to 7 conditions per place. [2021-03-25 14:49:22,735 INFO L142 LiptonReduction]: Number of co-enabled transitions 256 [2021-03-25 14:49:22,739 INFO L154 LiptonReduction]: Checked pairs total: 275 [2021-03-25 14:49:22,739 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:49:22,739 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 14:49:22,739 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 106 flow [2021-03-25 14:49:22,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,740 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:22,740 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:22,740 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:49:22,740 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1313154008, now seen corresponding path program 2 times [2021-03-25 14:49:22,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:22,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372513117] [2021-03-25 14:49:22,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:22,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:49:22,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:22,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:49:22,837 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-25 14:49:22,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:49:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:22,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372513117] [2021-03-25 14:49:22,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:22,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:49:22,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947564790] [2021-03-25 14:49:22,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:49:22,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:49:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:49:22,874 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 171 [2021-03-25 14:49:22,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:22,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 171 [2021-03-25 14:49:22,874 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:22,952 INFO L129 PetriNetUnfolder]: 106/251 cut-off events. [2021-03-25 14:49:22,952 INFO L130 PetriNetUnfolder]: For 267/280 co-relation queries the response was YES. [2021-03-25 14:49:22,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 251 events. 106/251 cut-off events. For 267/280 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1271 event pairs, 38 based on Foata normal form. 6/236 useless extension candidates. Maximal degree in co-relation 547. Up to 173 conditions per place. [2021-03-25 14:49:22,954 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2021-03-25 14:49:22,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 152 flow [2021-03-25 14:49:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:49:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:49:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2021-03-25 14:49:22,956 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7543859649122807 [2021-03-25 14:49:22,956 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2021-03-25 14:49:22,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2021-03-25 14:49:22,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:22,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2021-03-25 14:49:22,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,959 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:22,959 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 106 flow. Second operand 4 states and 516 transitions. [2021-03-25 14:49:22,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 152 flow [2021-03-25 14:49:22,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 137 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:49:22,961 INFO L241 Difference]: Finished difference. Result has 40 places, 31 transitions, 132 flow [2021-03-25 14:49:22,961 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2021-03-25 14:49:22,962 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-25 14:49:22,962 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:22,962 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 132 flow [2021-03-25 14:49:22,962 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 132 flow [2021-03-25 14:49:22,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 132 flow [2021-03-25 14:49:22,974 INFO L129 PetriNetUnfolder]: 29/98 cut-off events. [2021-03-25 14:49:22,974 INFO L130 PetriNetUnfolder]: For 73/75 co-relation queries the response was YES. [2021-03-25 14:49:22,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 98 events. 29/98 cut-off events. For 73/75 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 377 event pairs, 7 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 224. Up to 44 conditions per place. [2021-03-25 14:49:22,975 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-25 14:49:23,018 INFO L154 LiptonReduction]: Checked pairs total: 133 [2021-03-25 14:49:23,018 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:49:23,018 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-25 14:49:23,021 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 132 flow [2021-03-25 14:49:23,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,022 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:23,022 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:23,022 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:49:23,022 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:23,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1982060451, now seen corresponding path program 1 times [2021-03-25 14:49:23,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:23,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701285830] [2021-03-25 14:49:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:23,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:23,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:23,086 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:49:23,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:49:23,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:23,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:49:23,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:23,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701285830] [2021-03-25 14:49:23,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:23,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:49:23,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982304678] [2021-03-25 14:49:23,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:49:23,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:23,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:49:23,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:49:23,095 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2021-03-25 14:49:23,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:23,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2021-03-25 14:49:23,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:23,165 INFO L129 PetriNetUnfolder]: 173/382 cut-off events. [2021-03-25 14:49:23,165 INFO L130 PetriNetUnfolder]: For 217/239 co-relation queries the response was YES. [2021-03-25 14:49:23,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 382 events. 173/382 cut-off events. For 217/239 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2182 event pairs, 50 based on Foata normal form. 31/340 useless extension candidates. Maximal degree in co-relation 868. Up to 238 conditions per place. [2021-03-25 14:49:23,168 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2021-03-25 14:49:23,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 190 flow [2021-03-25 14:49:23,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:49:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:49:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 725 transitions. [2021-03-25 14:49:23,169 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2021-03-25 14:49:23,170 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 725 transitions. [2021-03-25 14:49:23,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 725 transitions. [2021-03-25 14:49:23,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:23,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 725 transitions. [2021-03-25 14:49:23,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,172 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 132 flow. Second operand 5 states and 725 transitions. [2021-03-25 14:49:23,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 190 flow [2021-03-25 14:49:23,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:49:23,174 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 192 flow [2021-03-25 14:49:23,174 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=132, 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=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-25 14:49:23,174 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-03-25 14:49:23,175 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:23,175 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 192 flow [2021-03-25 14:49:23,175 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 192 flow [2021-03-25 14:49:23,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 192 flow [2021-03-25 14:49:23,204 INFO L129 PetriNetUnfolder]: 140/323 cut-off events. [2021-03-25 14:49:23,204 INFO L130 PetriNetUnfolder]: For 396/447 co-relation queries the response was YES. [2021-03-25 14:49:23,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 323 events. 140/323 cut-off events. For 396/447 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1838 event pairs, 49 based on Foata normal form. 13/309 useless extension candidates. Maximal degree in co-relation 946. Up to 169 conditions per place. [2021-03-25 14:49:23,207 INFO L142 LiptonReduction]: Number of co-enabled transitions 366 [2021-03-25 14:49:23,215 INFO L154 LiptonReduction]: Checked pairs total: 227 [2021-03-25 14:49:23,215 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:49:23,215 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-25 14:49:23,215 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 186 flow [2021-03-25 14:49:23,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,216 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:23,216 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:23,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:49:23,217 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2052300434, now seen corresponding path program 1 times [2021-03-25 14:49:23,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:23,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137888327] [2021-03-25 14:49:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:23,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:23,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:23,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:23,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:23,267 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:49:23,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:49:23,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:23,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:49:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:23,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137888327] [2021-03-25 14:49:23,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:23,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:49:23,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572386127] [2021-03-25 14:49:23,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:49:23,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:23,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:49:23,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:49:23,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2021-03-25 14:49:23,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:23,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2021-03-25 14:49:23,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:23,335 INFO L129 PetriNetUnfolder]: 105/265 cut-off events. [2021-03-25 14:49:23,335 INFO L130 PetriNetUnfolder]: For 266/339 co-relation queries the response was YES. [2021-03-25 14:49:23,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 265 events. 105/265 cut-off events. For 266/339 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1348 event pairs, 8 based on Foata normal form. 45/284 useless extension candidates. Maximal degree in co-relation 884. Up to 159 conditions per place. [2021-03-25 14:49:23,337 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 8 selfloop transitions, 11 changer transitions 3/46 dead transitions. [2021-03-25 14:49:23,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 274 flow [2021-03-25 14:49:23,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:49:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:49:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 870 transitions. [2021-03-25 14:49:23,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2021-03-25 14:49:23,340 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 870 transitions. [2021-03-25 14:49:23,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 870 transitions. [2021-03-25 14:49:23,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:23,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 870 transitions. [2021-03-25 14:49:23,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,343 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,343 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 186 flow. Second operand 6 states and 870 transitions. [2021-03-25 14:49:23,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 274 flow [2021-03-25 14:49:23,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 268 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:49:23,347 INFO L241 Difference]: Finished difference. Result has 51 places, 41 transitions, 250 flow [2021-03-25 14:49:23,348 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2021-03-25 14:49:23,348 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2021-03-25 14:49:23,348 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:23,348 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 41 transitions, 250 flow [2021-03-25 14:49:23,348 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 41 transitions, 250 flow [2021-03-25 14:49:23,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 250 flow [2021-03-25 14:49:23,365 INFO L129 PetriNetUnfolder]: 60/190 cut-off events. [2021-03-25 14:49:23,366 INFO L130 PetriNetUnfolder]: For 358/372 co-relation queries the response was YES. [2021-03-25 14:49:23,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 190 events. 60/190 cut-off events. For 358/372 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 980 event pairs, 9 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 683. Up to 111 conditions per place. [2021-03-25 14:49:23,367 INFO L142 LiptonReduction]: Number of co-enabled transitions 338 [2021-03-25 14:49:23,425 INFO L154 LiptonReduction]: Checked pairs total: 220 [2021-03-25 14:49:23,425 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:49:23,425 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 77 [2021-03-25 14:49:23,425 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 242 flow [2021-03-25 14:49:23,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,426 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:23,426 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:23,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:49:23,426 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:23,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1441236532, now seen corresponding path program 1 times [2021-03-25 14:49:23,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:23,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716767618] [2021-03-25 14:49:23,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:49:23,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:23,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:23,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:23,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:23,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:23,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:49:23,474 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:49:23,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:49:23,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:49:23,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:49:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:49:23,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716767618] [2021-03-25 14:49:23,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:49:23,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:49:23,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378667537] [2021-03-25 14:49:23,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:49:23,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:49:23,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:49:23,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:49:23,481 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2021-03-25 14:49:23,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:49:23,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2021-03-25 14:49:23,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:49:23,536 INFO L129 PetriNetUnfolder]: 74/189 cut-off events. [2021-03-25 14:49:23,536 INFO L130 PetriNetUnfolder]: For 381/434 co-relation queries the response was YES. [2021-03-25 14:49:23,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 189 events. 74/189 cut-off events. For 381/434 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 831 event pairs, 2 based on Foata normal form. 25/191 useless extension candidates. Maximal degree in co-relation 717. Up to 108 conditions per place. [2021-03-25 14:49:23,540 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 5 selfloop transitions, 11 changer transitions 4/43 dead transitions. [2021-03-25 14:49:23,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 284 flow [2021-03-25 14:49:23,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:49:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:49:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2021-03-25 14:49:23,542 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8429406850459482 [2021-03-25 14:49:23,542 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1009 transitions. [2021-03-25 14:49:23,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1009 transitions. [2021-03-25 14:49:23,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:49:23,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1009 transitions. [2021-03-25 14:49:23,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.14285714285714) internal successors, (1009), 7 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,547 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:23,547 INFO L185 Difference]: Start difference. First operand has 51 places, 40 transitions, 242 flow. Second operand 7 states and 1009 transitions. [2021-03-25 14:49:23,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 284 flow [2021-03-25 14:49:23,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 252 flow, removed 13 selfloop flow, removed 4 redundant places. [2021-03-25 14:49:23,549 INFO L241 Difference]: Finished difference. Result has 54 places, 37 transitions, 218 flow [2021-03-25 14:49:23,549 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2021-03-25 14:49:23,549 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2021-03-25 14:49:23,549 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:49:23,549 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 37 transitions, 218 flow [2021-03-25 14:49:23,549 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 37 transitions, 218 flow [2021-03-25 14:49:23,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 37 transitions, 218 flow [2021-03-25 14:49:23,557 INFO L129 PetriNetUnfolder]: 26/110 cut-off events. [2021-03-25 14:49:23,558 INFO L130 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2021-03-25 14:49:23,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 110 events. 26/110 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 439 event pairs, 2 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 366. Up to 37 conditions per place. [2021-03-25 14:49:23,559 INFO L142 LiptonReduction]: Number of co-enabled transitions 258 [2021-03-25 14:49:23,840 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 14:49:23,988 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 14:49:24,608 WARN L205 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-25 14:49:24,811 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 14:49:26,132 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 348 DAG size of output: 276 [2021-03-25 14:49:26,704 WARN L205 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 14:49:26,709 INFO L154 LiptonReduction]: Checked pairs total: 191 [2021-03-25 14:49:26,709 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:49:26,709 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3160 [2021-03-25 14:49:26,710 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 218 flow [2021-03-25 14:49:26,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:49:26,710 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:49:26,710 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:49:26,710 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:49:26,710 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:49:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:49:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1858311844, now seen corresponding path program 1 times [2021-03-25 14:49:26,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:49:26,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546177805] [2021-03-25 14:49:26,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:49:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:49:26,734 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:49:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:49:26,759 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:49:26,777 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:49:26,777 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:49:26,777 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:49:26,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:49:26 BasicIcfg [2021-03-25 14:49:26,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:49:26,839 INFO L168 Benchmark]: Toolchain (without parser) took 17598.75 ms. Allocated memory was 255.9 MB in the beginning and 599.8 MB in the end (delta: 343.9 MB). Free memory was 234.1 MB in the beginning and 406.4 MB in the end (delta: -172.4 MB). Peak memory consumption was 172.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:49:26,839 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:49:26,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.93 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 234.1 MB in the beginning and 301.0 MB in the end (delta: -66.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:49:26,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.01 ms. Allocated memory is still 341.8 MB. Free memory was 301.0 MB in the beginning and 298.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:49:26,840 INFO L168 Benchmark]: Boogie Preprocessor took 20.21 ms. Allocated memory is still 341.8 MB. Free memory was 298.4 MB in the beginning and 296.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:49:26,840 INFO L168 Benchmark]: RCFGBuilder took 1310.02 ms. Allocated memory is still 341.8 MB. Free memory was 296.1 MB in the beginning and 288.5 MB in the end (delta: 7.7 MB). Peak memory consumption was 72.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:49:26,840 INFO L168 Benchmark]: TraceAbstraction took 15890.08 ms. Allocated memory was 341.8 MB in the beginning and 599.8 MB in the end (delta: 257.9 MB). Free memory was 287.4 MB in the beginning and 406.4 MB in the end (delta: -119.0 MB). Peak memory consumption was 138.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:49:26,841 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.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 337.93 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 234.1 MB in the beginning and 301.0 MB in the end (delta: -66.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 35.01 ms. Allocated memory is still 341.8 MB. Free memory was 301.0 MB in the beginning and 298.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 20.21 ms. Allocated memory is still 341.8 MB. Free memory was 298.4 MB in the beginning and 296.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1310.02 ms. Allocated memory is still 341.8 MB. Free memory was 296.1 MB in the beginning and 288.5 MB in the end (delta: 7.7 MB). Peak memory consumption was 72.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15890.08 ms. Allocated memory was 341.8 MB in the beginning and 599.8 MB in the end (delta: 257.9 MB). Free memory was 287.4 MB in the beginning and 406.4 MB in the end (delta: -119.0 MB). Peak memory consumption was 138.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6979.2ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 2882 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1370, positive: 1298, positive conditional: 0, positive unconditional: 1298, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1026, positive: 992, positive conditional: 0, positive unconditional: 992, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1026, positive: 992, positive conditional: 0, positive unconditional: 992, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1026, positive: 986, positive conditional: 0, positive unconditional: 986, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 436, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 416, negative conditional: 0, negative unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1370, positive: 306, positive conditional: 0, positive unconditional: 306, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 1026, unknown conditional: 0, unknown unconditional: 1026] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2495.1ms, 45 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1242 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 333, positive: 244, positive conditional: 0, positive unconditional: 244, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 333, positive: 213, positive conditional: 0, positive unconditional: 213, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 39, unknown conditional: 0, unknown unconditional: 39] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1025.1ms, 34 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 780 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 140, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 246 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7ms, 35 PlacesBefore, 35 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 244 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0ms, 36 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 225 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 187.1ms, 41 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 277 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 178, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.7ms, 39 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 275 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.2ms, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 133 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 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] ], Cache Queries: [ total: 23, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.1ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 227 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 76.8ms, 51 PlacesBefore, 51 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3159.6ms, 54 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 35 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 191 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 62, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1882; [L819] FCALL, FORK 0 pthread_create(&t1882, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1883; [L821] FCALL, FORK 0 pthread_create(&t1883, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1884; [L823] FCALL, FORK 0 pthread_create(&t1884, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15751.2ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 602.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7037.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 47 SDtfs, 22 SDslu, 24 SDs, 0 SdLazy, 177 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 151.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 135.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 25.2ms SsaConstructionTime, 324.1ms SatisfiabilityAnalysisTime, 486.2ms InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 510 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...