/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:35:49,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:35:49,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:35:49,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:35:49,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:35:49,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:35:49,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:35:49,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:35:49,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:35:49,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:35:49,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:35:49,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:35:49,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:35:49,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:35:49,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:35:49,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:35:49,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:35:49,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:35:49,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:35:49,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:35:49,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:35:49,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:35:49,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:35:49,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:35:49,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:35:49,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:35:49,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:35:49,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:35:49,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:35:49,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:35:49,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:35:49,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:35:49,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:35:49,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:35:49,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:35:49,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:35:49,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:35:49,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:35:49,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:35:49,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:35:49,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:35:49,325 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:35:49,357 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:35:49,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:35:49,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:35:49,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:35:49,362 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:35:49,362 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:35:49,362 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:35:49,362 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:35:49,362 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:35:49,363 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:35:49,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:35:49,364 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:35:49,364 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:35:49,364 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:35:49,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:35:49,364 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:35:49,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:35:49,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:35:49,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:35:49,365 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:35:49,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:35:49,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:35:49,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:35:49,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:35:49,366 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:35:49,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:35:49,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:35:49,366 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:35:49,366 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:35:49,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:35:49,366 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:35:49,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:35:49,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:35:49,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:35:49,711 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:35:49,712 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:35:49,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i [2021-03-26 00:35:49,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/478a247be/418440bfec024b338046884996163286/FLAG3466c492b [2021-03-26 00:35:50,342 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:35:50,342 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i [2021-03-26 00:35:50,368 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/478a247be/418440bfec024b338046884996163286/FLAG3466c492b [2021-03-26 00:35:50,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/478a247be/418440bfec024b338046884996163286 [2021-03-26 00:35:50,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:35:50,642 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:35:50,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:35:50,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:35:50,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:35:50,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:35:50" (1/1) ... [2021-03-26 00:35:50,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@508f892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:50, skipping insertion in model container [2021-03-26 00:35:50,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:35:50" (1/1) ... [2021-03-26 00:35:50,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:35:50,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:35:50,859 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i[994,1007] [2021-03-26 00:35:51,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:35:51,103 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:35:51,115 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/safe005_power.opt.i[994,1007] [2021-03-26 00:35:51,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:35:51,251 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:35:51,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51 WrapperNode [2021-03-26 00:35:51,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:35:51,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:35:51,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:35:51,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:35:51,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (1/1) ... [2021-03-26 00:35:51,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (1/1) ... [2021-03-26 00:35:51,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:35:51,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:35:51,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:35:51,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:35:51,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (1/1) ... [2021-03-26 00:35:51,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (1/1) ... [2021-03-26 00:35:51,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (1/1) ... [2021-03-26 00:35:51,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (1/1) ... [2021-03-26 00:35:51,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (1/1) ... [2021-03-26 00:35:51,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (1/1) ... [2021-03-26 00:35:51,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (1/1) ... [2021-03-26 00:35:51,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:35:51,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:35:51,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:35:51,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:35:51,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:35:51,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:35:51,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:35:51,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:35:51,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:35:51,446 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:35:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:35:51,446 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:35:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:35:51,446 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:35:51,446 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:35:51,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:35:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:35:51,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:35:51,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:35:51,448 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:35:53,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:35:53,042 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:35:53,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:35:53 BoogieIcfgContainer [2021-03-26 00:35:53,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:35:53,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:35:53,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:35:53,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:35:53,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:35:50" (1/3) ... [2021-03-26 00:35:53,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5deee1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:35:53, skipping insertion in model container [2021-03-26 00:35:53,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:35:51" (2/3) ... [2021-03-26 00:35:53,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5deee1fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:35:53, skipping insertion in model container [2021-03-26 00:35:53,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:35:53" (3/3) ... [2021-03-26 00:35:53,050 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_power.opt.i [2021-03-26 00:35:53,055 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:35:53,059 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:35:53,059 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:35:53,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,096 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,099 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,102 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,103 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,113 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,114 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,114 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,117 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:35:53,117 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:35:53,132 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:35:53,148 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:35:53,149 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:35:53,149 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:35:53,149 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:35:53,149 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:35:53,149 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:35:53,149 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:35:53,149 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:35:53,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:35:53,187 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:35:53,187 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:53,190 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 64 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-26 00:35:53,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:35:53,194 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 00:35:53,195 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:53,204 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:35:53,207 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:35:53,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 00:35:53,224 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:35:53,224 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:53,225 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 58 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-26 00:35:53,227 INFO L142 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-26 00:35:54,241 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:35:54,666 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:35:54,810 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:35:56,135 INFO L154 LiptonReduction]: Checked pairs total: 2292 [2021-03-26 00:35:56,135 INFO L156 LiptonReduction]: Total number of compositions: 63 [2021-03-26 00:35:56,137 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2943 [2021-03-26 00:35:56,151 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-26 00:35:56,152 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:56,152 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:56,153 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:56,158 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:56,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:56,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1578923408, now seen corresponding path program 1 times [2021-03-26 00:35:56,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:56,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656587716] [2021-03-26 00:35:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:56,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:56,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:56,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:56,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:56,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656587716] [2021-03-26 00:35:56,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:56,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:35:56,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175907908] [2021-03-26 00:35:56,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:35:56,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:56,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:35:56,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:35:56,434 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 160 [2021-03-26 00:35:56,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:56,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:56,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 160 [2021-03-26 00:35:56,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:56,523 INFO L129 PetriNetUnfolder]: 29/139 cut-off events. [2021-03-26 00:35:56,523 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:56,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 139 events. 29/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 579 event pairs, 15 based on Foata normal form. 9/131 useless extension candidates. Maximal degree in co-relation 185. Up to 41 conditions per place. [2021-03-26 00:35:56,527 INFO L132 encePairwiseOnDemand]: 156/160 looper letters, 7 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2021-03-26 00:35:56,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 101 flow [2021-03-26 00:35:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:35:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:35:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2021-03-26 00:35:56,544 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9125 [2021-03-26 00:35:56,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2021-03-26 00:35:56,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2021-03-26 00:35:56,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:56,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2021-03-26 00:35:56,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:56,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:56,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:56,566 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 438 transitions. [2021-03-26 00:35:56,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 101 flow [2021-03-26 00:35:56,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:35:56,570 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 78 flow [2021-03-26 00:35:56,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-26 00:35:56,572 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-26 00:35:56,572 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:56,572 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-26 00:35:56,573 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-26 00:35:56,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-26 00:35:56,578 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 00:35:56,579 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:56,579 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:35:56,580 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-26 00:35:57,658 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 00:35:58,249 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:35:58,392 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:35:58,721 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:35:58,855 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:35:58,860 INFO L154 LiptonReduction]: Checked pairs total: 1420 [2021-03-26 00:35:58,861 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:35:58,861 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2289 [2021-03-26 00:35:58,862 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-26 00:35:58,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:58,863 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:58,863 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:58,863 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:35:58,863 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:58,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:58,864 INFO L82 PathProgramCache]: Analyzing trace with hash 345032814, now seen corresponding path program 1 times [2021-03-26 00:35:58,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:58,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105871963] [2021-03-26 00:35:58,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:58,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:58,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:58,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:58,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:58,942 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:35:58,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:35:58,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:58,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105871963] [2021-03-26 00:35:58,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:58,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:35:58,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304166220] [2021-03-26 00:35:58,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:35:58,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:58,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:35:58,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:35:58,951 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 172 [2021-03-26 00:35:58,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:58,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:58,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 172 [2021-03-26 00:35:58,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:58,982 INFO L129 PetriNetUnfolder]: 1/26 cut-off events. [2021-03-26 00:35:58,983 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:58,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 34. Up to 3 conditions per place. [2021-03-26 00:35:58,983 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 1 selfloop transitions, 2 changer transitions 5/25 dead transitions. [2021-03-26 00:35:58,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 72 flow [2021-03-26 00:35:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:35:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:35:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2021-03-26 00:35:58,985 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8569767441860465 [2021-03-26 00:35:58,985 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2021-03-26 00:35:58,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2021-03-26 00:35:58,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:58,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2021-03-26 00:35:58,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:58,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:58,990 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:58,990 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 737 transitions. [2021-03-26 00:35:58,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 72 flow [2021-03-26 00:35:58,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 25 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:35:58,991 INFO L241 Difference]: Finished difference. Result has 35 places, 20 transitions, 54 flow [2021-03-26 00:35:58,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2021-03-26 00:35:58,992 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -11 predicate places. [2021-03-26 00:35:58,992 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:58,992 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 20 transitions, 54 flow [2021-03-26 00:35:58,993 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 20 transitions, 54 flow [2021-03-26 00:35:58,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2021-03-26 00:35:58,996 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-26 00:35:58,996 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:35:58,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:35:58,997 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-26 00:35:59,072 INFO L154 LiptonReduction]: Checked pairs total: 215 [2021-03-26 00:35:59,073 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:59,073 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 81 [2021-03-26 00:35:59,074 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-03-26 00:35:59,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:59,075 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:59,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:35:59,075 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:59,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1526229437, now seen corresponding path program 1 times [2021-03-26 00:35:59,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:59,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132806915] [2021-03-26 00:35:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:59,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:59,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:59,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132806915] [2021-03-26 00:35:59,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:59,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:35:59,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700828763] [2021-03-26 00:35:59,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:35:59,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:59,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:35:59,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:35:59,151 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 172 [2021-03-26 00:35:59,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:59,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 172 [2021-03-26 00:35:59,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:59,168 INFO L129 PetriNetUnfolder]: 16/66 cut-off events. [2021-03-26 00:35:59,168 INFO L130 PetriNetUnfolder]: For 11/21 co-relation queries the response was YES. [2021-03-26 00:35:59,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 66 events. 16/66 cut-off events. For 11/21 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 212 event pairs, 7 based on Foata normal form. 2/67 useless extension candidates. Maximal degree in co-relation 115. Up to 32 conditions per place. [2021-03-26 00:35:59,169 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 7 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-26 00:35:59,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 24 transitions, 85 flow [2021-03-26 00:35:59,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:35:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:35:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2021-03-26 00:35:59,172 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2021-03-26 00:35:59,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2021-03-26 00:35:59,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2021-03-26 00:35:59,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:59,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2021-03-26 00:35:59,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,174 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 452 transitions. [2021-03-26 00:35:59,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 24 transitions, 85 flow [2021-03-26 00:35:59,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 24 transitions, 79 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:35:59,175 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 69 flow [2021-03-26 00:35:59,175 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-03-26 00:35:59,175 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -15 predicate places. [2021-03-26 00:35:59,176 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:59,176 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 69 flow [2021-03-26 00:35:59,176 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 69 flow [2021-03-26 00:35:59,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 69 flow [2021-03-26 00:35:59,180 INFO L129 PetriNetUnfolder]: 3/30 cut-off events. [2021-03-26 00:35:59,180 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 00:35:59,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 00:35:59,181 INFO L142 LiptonReduction]: Number of co-enabled transitions 210 [2021-03-26 00:35:59,240 INFO L154 LiptonReduction]: Checked pairs total: 188 [2021-03-26 00:35:59,240 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:59,240 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-03-26 00:35:59,241 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 69 flow [2021-03-26 00:35:59,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,242 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:59,242 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:59,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:35:59,242 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:59,242 INFO L82 PathProgramCache]: Analyzing trace with hash -45422738, now seen corresponding path program 1 times [2021-03-26 00:35:59,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:59,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534021466] [2021-03-26 00:35:59,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:59,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:59,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:59,289 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:35:59,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:35:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:59,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534021466] [2021-03-26 00:35:59,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:59,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:35:59,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348718244] [2021-03-26 00:35:59,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:35:59,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:59,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:35:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:35:59,300 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 172 [2021-03-26 00:35:59,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:59,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 172 [2021-03-26 00:35:59,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:59,326 INFO L129 PetriNetUnfolder]: 19/86 cut-off events. [2021-03-26 00:35:59,327 INFO L130 PetriNetUnfolder]: For 47/67 co-relation queries the response was YES. [2021-03-26 00:35:59,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 86 events. 19/86 cut-off events. For 47/67 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 351 event pairs, 7 based on Foata normal form. 11/93 useless extension candidates. Maximal degree in co-relation 173. Up to 24 conditions per place. [2021-03-26 00:35:59,327 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 9 selfloop transitions, 6 changer transitions 1/29 dead transitions. [2021-03-26 00:35:59,327 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 127 flow [2021-03-26 00:35:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:35:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:35:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2021-03-26 00:35:59,329 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8168604651162791 [2021-03-26 00:35:59,330 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2021-03-26 00:35:59,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2021-03-26 00:35:59,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:59,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2021-03-26 00:35:59,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,333 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,333 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 69 flow. Second operand 4 states and 562 transitions. [2021-03-26 00:35:59,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 127 flow [2021-03-26 00:35:59,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:35:59,334 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 116 flow [2021-03-26 00:35:59,334 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-26 00:35:59,335 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -10 predicate places. [2021-03-26 00:35:59,335 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:59,335 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 116 flow [2021-03-26 00:35:59,335 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 116 flow [2021-03-26 00:35:59,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 116 flow [2021-03-26 00:35:59,343 INFO L129 PetriNetUnfolder]: 7/58 cut-off events. [2021-03-26 00:35:59,343 INFO L130 PetriNetUnfolder]: For 62/71 co-relation queries the response was YES. [2021-03-26 00:35:59,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 58 events. 7/58 cut-off events. For 62/71 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 204 event pairs, 2 based on Foata normal form. 1/56 useless extension candidates. Maximal degree in co-relation 121. Up to 18 conditions per place. [2021-03-26 00:35:59,344 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-26 00:35:59,384 INFO L154 LiptonReduction]: Checked pairs total: 187 [2021-03-26 00:35:59,385 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:59,385 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-03-26 00:35:59,386 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 116 flow [2021-03-26 00:35:59,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,386 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:59,386 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:59,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:35:59,387 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1407700794, now seen corresponding path program 1 times [2021-03-26 00:35:59,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:59,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96427740] [2021-03-26 00:35:59,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:59,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:59,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:59,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:59,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:59,434 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:35:59,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:35:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:59,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96427740] [2021-03-26 00:35:59,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:59,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:35:59,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939099563] [2021-03-26 00:35:59,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:35:59,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:59,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:35:59,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:35:59,446 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 172 [2021-03-26 00:35:59,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:59,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 172 [2021-03-26 00:35:59,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:59,484 INFO L129 PetriNetUnfolder]: 15/90 cut-off events. [2021-03-26 00:35:59,484 INFO L130 PetriNetUnfolder]: For 101/131 co-relation queries the response was YES. [2021-03-26 00:35:59,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 90 events. 15/90 cut-off events. For 101/131 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 405 event pairs, 5 based on Foata normal form. 8/95 useless extension candidates. Maximal degree in co-relation 226. Up to 27 conditions per place. [2021-03-26 00:35:59,485 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 7 selfloop transitions, 7 changer transitions 6/33 dead transitions. [2021-03-26 00:35:59,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 197 flow [2021-03-26 00:35:59,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:35:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:35:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2021-03-26 00:35:59,488 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8162790697674419 [2021-03-26 00:35:59,488 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2021-03-26 00:35:59,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2021-03-26 00:35:59,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:59,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2021-03-26 00:35:59,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,492 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,492 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 116 flow. Second operand 5 states and 702 transitions. [2021-03-26 00:35:59,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 197 flow [2021-03-26 00:35:59,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 189 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:35:59,494 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 121 flow [2021-03-26 00:35:59,494 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2021-03-26 00:35:59,494 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2021-03-26 00:35:59,495 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:59,495 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 121 flow [2021-03-26 00:35:59,495 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 121 flow [2021-03-26 00:35:59,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 25 transitions, 121 flow [2021-03-26 00:35:59,502 INFO L129 PetriNetUnfolder]: 3/45 cut-off events. [2021-03-26 00:35:59,502 INFO L130 PetriNetUnfolder]: For 38/41 co-relation queries the response was YES. [2021-03-26 00:35:59,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 45 events. 3/45 cut-off events. For 38/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 101. Up to 12 conditions per place. [2021-03-26 00:35:59,503 INFO L142 LiptonReduction]: Number of co-enabled transitions 222 [2021-03-26 00:35:59,510 INFO L154 LiptonReduction]: Checked pairs total: 193 [2021-03-26 00:35:59,510 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:59,510 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 00:35:59,511 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 121 flow [2021-03-26 00:35:59,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,511 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:59,511 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:59,512 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:35:59,512 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:59,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:59,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1278673696, now seen corresponding path program 1 times [2021-03-26 00:35:59,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:59,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83332645] [2021-03-26 00:35:59,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:59,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:59,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:35:59,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:59,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:59,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:59,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:59,583 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:35:59,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:35:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:59,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83332645] [2021-03-26 00:35:59,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:59,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:35:59,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555562166] [2021-03-26 00:35:59,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:35:59,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:59,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:35:59,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:35:59,598 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 172 [2021-03-26 00:35:59,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:59,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 172 [2021-03-26 00:35:59,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:35:59,685 INFO L129 PetriNetUnfolder]: 16/104 cut-off events. [2021-03-26 00:35:59,685 INFO L130 PetriNetUnfolder]: For 118/121 co-relation queries the response was YES. [2021-03-26 00:35:59,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 104 events. 16/104 cut-off events. For 118/121 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 532 event pairs, 3 based on Foata normal form. 5/106 useless extension candidates. Maximal degree in co-relation 280. Up to 23 conditions per place. [2021-03-26 00:35:59,686 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 5 selfloop transitions, 8 changer transitions 11/37 dead transitions. [2021-03-26 00:35:59,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 243 flow [2021-03-26 00:35:59,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:35:59,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:35:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 981 transitions. [2021-03-26 00:35:59,689 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8147840531561462 [2021-03-26 00:35:59,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 981 transitions. [2021-03-26 00:35:59,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 981 transitions. [2021-03-26 00:35:59,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:35:59,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 981 transitions. [2021-03-26 00:35:59,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.14285714285714) internal successors, (981), 7 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,693 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,694 INFO L185 Difference]: Start difference. First operand has 39 places, 25 transitions, 121 flow. Second operand 7 states and 981 transitions. [2021-03-26 00:35:59,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 243 flow [2021-03-26 00:35:59,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 213 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-26 00:35:59,698 INFO L241 Difference]: Finished difference. Result has 47 places, 26 transitions, 157 flow [2021-03-26 00:35:59,698 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=157, PETRI_PLACES=47, PETRI_TRANSITIONS=26} [2021-03-26 00:35:59,698 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2021-03-26 00:35:59,699 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:35:59,699 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 26 transitions, 157 flow [2021-03-26 00:35:59,699 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 26 transitions, 157 flow [2021-03-26 00:35:59,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 26 transitions, 157 flow [2021-03-26 00:35:59,708 INFO L129 PetriNetUnfolder]: 6/55 cut-off events. [2021-03-26 00:35:59,708 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2021-03-26 00:35:59,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 55 events. 6/55 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 194 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 154. Up to 14 conditions per place. [2021-03-26 00:35:59,709 INFO L142 LiptonReduction]: Number of co-enabled transitions 198 [2021-03-26 00:35:59,877 INFO L154 LiptonReduction]: Checked pairs total: 188 [2021-03-26 00:35:59,877 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:35:59,877 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 178 [2021-03-26 00:35:59,880 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 157 flow [2021-03-26 00:35:59,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,881 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:35:59,881 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:35:59,881 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:35:59,881 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:35:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:35:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -215698439, now seen corresponding path program 1 times [2021-03-26 00:35:59,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:35:59,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001677584] [2021-03-26 00:35:59,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:35:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:35:59,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:59,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:59,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:35:59,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:35:59,973 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:35:59,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:35:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:35:59,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001677584] [2021-03-26 00:35:59,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:35:59,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:35:59,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665242055] [2021-03-26 00:35:59,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:35:59,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:35:59,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:35:59,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:35:59,988 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 172 [2021-03-26 00:35:59,989 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:35:59,989 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:35:59,989 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 172 [2021-03-26 00:35:59,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:00,026 INFO L129 PetriNetUnfolder]: 4/73 cut-off events. [2021-03-26 00:36:00,026 INFO L130 PetriNetUnfolder]: For 192/206 co-relation queries the response was YES. [2021-03-26 00:36:00,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 73 events. 4/73 cut-off events. For 192/206 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 346 event pairs, 0 based on Foata normal form. 6/77 useless extension candidates. Maximal degree in co-relation 237. Up to 17 conditions per place. [2021-03-26 00:36:00,027 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 6 selfloop transitions, 7 changer transitions 5/31 dead transitions. [2021-03-26 00:36:00,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 31 transitions, 241 flow [2021-03-26 00:36:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:36:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:36:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2021-03-26 00:36:00,029 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8151162790697675 [2021-03-26 00:36:00,029 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2021-03-26 00:36:00,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2021-03-26 00:36:00,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:00,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2021-03-26 00:36:00,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,033 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,033 INFO L185 Difference]: Start difference. First operand has 45 places, 26 transitions, 157 flow. Second operand 5 states and 701 transitions. [2021-03-26 00:36:00,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 31 transitions, 241 flow [2021-03-26 00:36:00,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 31 transitions, 195 flow, removed 14 selfloop flow, removed 5 redundant places. [2021-03-26 00:36:00,035 INFO L241 Difference]: Finished difference. Result has 45 places, 26 transitions, 145 flow [2021-03-26 00:36:00,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2021-03-26 00:36:00,035 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2021-03-26 00:36:00,035 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:00,035 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 26 transitions, 145 flow [2021-03-26 00:36:00,036 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 26 transitions, 145 flow [2021-03-26 00:36:00,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 26 transitions, 145 flow [2021-03-26 00:36:00,064 INFO L129 PetriNetUnfolder]: 4/46 cut-off events. [2021-03-26 00:36:00,064 INFO L130 PetriNetUnfolder]: For 66/67 co-relation queries the response was YES. [2021-03-26 00:36:00,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 46 events. 4/46 cut-off events. For 66/67 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 1 based on Foata normal form. 1/45 useless extension candidates. Maximal degree in co-relation 121. Up to 11 conditions per place. [2021-03-26 00:36:00,065 INFO L142 LiptonReduction]: Number of co-enabled transitions 194 [2021-03-26 00:36:00,100 INFO L154 LiptonReduction]: Checked pairs total: 421 [2021-03-26 00:36:00,100 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:36:00,100 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-03-26 00:36:00,101 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 151 flow [2021-03-26 00:36:00,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,101 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:00,102 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:00,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:36:00,102 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:36:00,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:00,102 INFO L82 PathProgramCache]: Analyzing trace with hash 905089615, now seen corresponding path program 2 times [2021-03-26 00:36:00,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:00,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891582448] [2021-03-26 00:36:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:00,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:00,187 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:36:00,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:36:00,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:36:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:00,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891582448] [2021-03-26 00:36:00,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:00,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:36:00,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230111577] [2021-03-26 00:36:00,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:36:00,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:00,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:36:00,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:36:00,194 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 173 [2021-03-26 00:36:00,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:00,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 173 [2021-03-26 00:36:00,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:00,253 INFO L129 PetriNetUnfolder]: 98/231 cut-off events. [2021-03-26 00:36:00,254 INFO L130 PetriNetUnfolder]: For 162/175 co-relation queries the response was YES. [2021-03-26 00:36:00,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 231 events. 98/231 cut-off events. For 162/175 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1230 event pairs, 38 based on Foata normal form. 29/250 useless extension candidates. Maximal degree in co-relation 530. Up to 147 conditions per place. [2021-03-26 00:36:00,257 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 5 selfloop transitions, 6 changer transitions 5/36 dead transitions. [2021-03-26 00:36:00,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 203 flow [2021-03-26 00:36:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:36:00,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:36:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2021-03-26 00:36:00,259 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8531791907514451 [2021-03-26 00:36:00,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2021-03-26 00:36:00,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2021-03-26 00:36:00,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:00,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2021-03-26 00:36:00,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,263 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,263 INFO L185 Difference]: Start difference. First operand has 45 places, 26 transitions, 151 flow. Second operand 5 states and 738 transitions. [2021-03-26 00:36:00,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 203 flow [2021-03-26 00:36:00,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 183 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-26 00:36:00,266 INFO L241 Difference]: Finished difference. Result has 48 places, 31 transitions, 177 flow [2021-03-26 00:36:00,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=5, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2021-03-26 00:36:00,266 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2021-03-26 00:36:00,266 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:00,266 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 31 transitions, 177 flow [2021-03-26 00:36:00,267 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 31 transitions, 177 flow [2021-03-26 00:36:00,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 31 transitions, 177 flow [2021-03-26 00:36:00,287 INFO L129 PetriNetUnfolder]: 67/195 cut-off events. [2021-03-26 00:36:00,288 INFO L130 PetriNetUnfolder]: For 216/243 co-relation queries the response was YES. [2021-03-26 00:36:00,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 195 events. 67/195 cut-off events. For 216/243 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1124 event pairs, 43 based on Foata normal form. 6/191 useless extension candidates. Maximal degree in co-relation 566. Up to 110 conditions per place. [2021-03-26 00:36:00,290 INFO L142 LiptonReduction]: Number of co-enabled transitions 250 [2021-03-26 00:36:00,369 INFO L154 LiptonReduction]: Checked pairs total: 171 [2021-03-26 00:36:00,369 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:36:00,369 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 103 [2021-03-26 00:36:00,370 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 177 flow [2021-03-26 00:36:00,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:00,370 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:00,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:36:00,370 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:36:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:00,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1215643136, now seen corresponding path program 1 times [2021-03-26 00:36:00,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:00,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038481348] [2021-03-26 00:36:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:00,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:00,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:00,463 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:36:00,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:36:00,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:36:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:00,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038481348] [2021-03-26 00:36:00,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:00,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:36:00,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308206841] [2021-03-26 00:36:00,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:36:00,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:00,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:36:00,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:36:00,474 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 173 [2021-03-26 00:36:00,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:00,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 173 [2021-03-26 00:36:00,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:00,540 INFO L129 PetriNetUnfolder]: 60/185 cut-off events. [2021-03-26 00:36:00,540 INFO L130 PetriNetUnfolder]: For 269/342 co-relation queries the response was YES. [2021-03-26 00:36:00,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 185 events. 60/185 cut-off events. For 269/342 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 990 event pairs, 6 based on Foata normal form. 68/249 useless extension candidates. Maximal degree in co-relation 648. Up to 100 conditions per place. [2021-03-26 00:36:00,541 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 5 selfloop transitions, 10 changer transitions 6/41 dead transitions. [2021-03-26 00:36:00,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 271 flow [2021-03-26 00:36:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:36:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:36:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1031 transitions. [2021-03-26 00:36:00,544 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8513625103220479 [2021-03-26 00:36:00,544 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1031 transitions. [2021-03-26 00:36:00,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1031 transitions. [2021-03-26 00:36:00,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:00,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1031 transitions. [2021-03-26 00:36:00,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.28571428571428) internal successors, (1031), 7 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,551 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,551 INFO L185 Difference]: Start difference. First operand has 48 places, 31 transitions, 177 flow. Second operand 7 states and 1031 transitions. [2021-03-26 00:36:00,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 271 flow [2021-03-26 00:36:00,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 260 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:36:00,553 INFO L241 Difference]: Finished difference. Result has 55 places, 35 transitions, 233 flow [2021-03-26 00:36:00,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2021-03-26 00:36:00,553 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2021-03-26 00:36:00,553 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:00,554 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 35 transitions, 233 flow [2021-03-26 00:36:00,554 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 35 transitions, 233 flow [2021-03-26 00:36:00,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 35 transitions, 233 flow [2021-03-26 00:36:00,571 INFO L129 PetriNetUnfolder]: 42/144 cut-off events. [2021-03-26 00:36:00,571 INFO L130 PetriNetUnfolder]: For 388/426 co-relation queries the response was YES. [2021-03-26 00:36:00,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 144 events. 42/144 cut-off events. For 388/426 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 710 event pairs, 7 based on Foata normal form. 10/150 useless extension candidates. Maximal degree in co-relation 552. Up to 73 conditions per place. [2021-03-26 00:36:00,573 INFO L142 LiptonReduction]: Number of co-enabled transitions 248 [2021-03-26 00:36:00,585 INFO L154 LiptonReduction]: Checked pairs total: 320 [2021-03-26 00:36:00,585 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:36:00,585 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-26 00:36:00,586 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 33 transitions, 217 flow [2021-03-26 00:36:00,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,586 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:00,586 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:00,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:36:00,586 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:36:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1228613670, now seen corresponding path program 1 times [2021-03-26 00:36:00,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:00,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094900758] [2021-03-26 00:36:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:00,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:36:00,718 INFO L142 QuantifierPusher]: treesize reduction 4, result has 80.0 percent of original size [2021-03-26 00:36:00,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:36:00,730 INFO L142 QuantifierPusher]: treesize reduction 12, result has 60.0 percent of original size [2021-03-26 00:36:00,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:36:00,749 INFO L142 QuantifierPusher]: treesize reduction 5, result has 72.2 percent of original size [2021-03-26 00:36:00,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:36:00,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:36:00,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:00,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:00,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094900758] [2021-03-26 00:36:00,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:00,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:36:00,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393749792] [2021-03-26 00:36:00,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:36:00,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:00,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:36:00,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:36:00,778 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 173 [2021-03-26 00:36:00,779 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 33 transitions, 217 flow. Second operand has 8 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,779 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:00,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 173 [2021-03-26 00:36:00,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:00,971 INFO L129 PetriNetUnfolder]: 130/358 cut-off events. [2021-03-26 00:36:00,971 INFO L130 PetriNetUnfolder]: For 1158/1225 co-relation queries the response was YES. [2021-03-26 00:36:00,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 358 events. 130/358 cut-off events. For 1158/1225 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2124 event pairs, 16 based on Foata normal form. 43/389 useless extension candidates. Maximal degree in co-relation 1491. Up to 178 conditions per place. [2021-03-26 00:36:00,974 INFO L132 encePairwiseOnDemand]: 167/173 looper letters, 10 selfloop transitions, 7 changer transitions 5/45 dead transitions. [2021-03-26 00:36:00,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 338 flow [2021-03-26 00:36:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:36:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:36:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 909 transitions. [2021-03-26 00:36:00,976 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7506193228736582 [2021-03-26 00:36:00,977 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 909 transitions. [2021-03-26 00:36:00,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 909 transitions. [2021-03-26 00:36:00,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:00,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 909 transitions. [2021-03-26 00:36:00,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,983 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 173.0) internal successors, (1384), 8 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:00,983 INFO L185 Difference]: Start difference. First operand has 54 places, 33 transitions, 217 flow. Second operand 7 states and 909 transitions. [2021-03-26 00:36:00,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 338 flow [2021-03-26 00:36:00,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 300 flow, removed 15 selfloop flow, removed 4 redundant places. [2021-03-26 00:36:00,991 INFO L241 Difference]: Finished difference. Result has 56 places, 37 transitions, 255 flow [2021-03-26 00:36:00,991 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2021-03-26 00:36:00,991 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2021-03-26 00:36:00,992 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:00,992 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 37 transitions, 255 flow [2021-03-26 00:36:00,992 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 37 transitions, 255 flow [2021-03-26 00:36:00,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 37 transitions, 255 flow [2021-03-26 00:36:01,024 INFO L129 PetriNetUnfolder]: 109/293 cut-off events. [2021-03-26 00:36:01,024 INFO L130 PetriNetUnfolder]: For 685/725 co-relation queries the response was YES. [2021-03-26 00:36:01,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 293 events. 109/293 cut-off events. For 685/725 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1638 event pairs, 11 based on Foata normal form. 19/303 useless extension candidates. Maximal degree in co-relation 1031. Up to 160 conditions per place. [2021-03-26 00:36:01,027 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-26 00:36:01,140 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-26 00:36:01,141 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:36:01,141 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 149 [2021-03-26 00:36:01,141 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 258 flow [2021-03-26 00:36:01,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 127.875) internal successors, (1023), 8 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,142 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:01,142 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:01,142 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:36:01,142 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:36:01,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash 908794137, now seen corresponding path program 1 times [2021-03-26 00:36:01,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:01,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447840391] [2021-03-26 00:36:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:01,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:01,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:01,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:01,209 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:36:01,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:36:01,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:01,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:36:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:01,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447840391] [2021-03-26 00:36:01,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:01,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:36:01,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776966868] [2021-03-26 00:36:01,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:36:01,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:36:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:36:01,220 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 174 [2021-03-26 00:36:01,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:01,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 174 [2021-03-26 00:36:01,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:01,290 INFO L129 PetriNetUnfolder]: 69/222 cut-off events. [2021-03-26 00:36:01,291 INFO L130 PetriNetUnfolder]: For 555/694 co-relation queries the response was YES. [2021-03-26 00:36:01,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 222 events. 69/222 cut-off events. For 555/694 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1221 event pairs, 0 based on Foata normal form. 106/319 useless extension candidates. Maximal degree in co-relation 897. Up to 135 conditions per place. [2021-03-26 00:36:01,292 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 2 selfloop transitions, 10 changer transitions 5/41 dead transitions. [2021-03-26 00:36:01,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 41 transitions, 324 flow [2021-03-26 00:36:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:36:01,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:36:01,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2021-03-26 00:36:01,295 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8481116584564861 [2021-03-26 00:36:01,295 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1033 transitions. [2021-03-26 00:36:01,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1033 transitions. [2021-03-26 00:36:01,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:01,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1033 transitions. [2021-03-26 00:36:01,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,300 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:01,300 INFO L185 Difference]: Start difference. First operand has 55 places, 37 transitions, 258 flow. Second operand 7 states and 1033 transitions. [2021-03-26 00:36:01,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 41 transitions, 324 flow [2021-03-26 00:36:01,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 41 transitions, 292 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 00:36:01,304 INFO L241 Difference]: Finished difference. Result has 60 places, 36 transitions, 256 flow [2021-03-26 00:36:01,304 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=60, PETRI_TRANSITIONS=36} [2021-03-26 00:36:01,304 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2021-03-26 00:36:01,304 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:01,304 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 36 transitions, 256 flow [2021-03-26 00:36:01,305 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 36 transitions, 256 flow [2021-03-26 00:36:01,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 36 transitions, 256 flow [2021-03-26 00:36:01,324 INFO L129 PetriNetUnfolder]: 46/157 cut-off events. [2021-03-26 00:36:01,324 INFO L130 PetriNetUnfolder]: For 308/340 co-relation queries the response was YES. [2021-03-26 00:36:01,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 157 events. 46/157 cut-off events. For 308/340 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 777 event pairs, 0 based on Foata normal form. 3/153 useless extension candidates. Maximal degree in co-relation 571. Up to 75 conditions per place. [2021-03-26 00:36:01,326 INFO L142 LiptonReduction]: Number of co-enabled transitions 168 [2021-03-26 00:36:01,453 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-26 00:36:01,673 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:36:01,790 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:36:02,134 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:36:02,312 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:36:02,317 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:36:02,317 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:36:02,317 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1013 [2021-03-26 00:36:02,318 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 266 flow [2021-03-26 00:36:02,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 145.83333333333334) internal successors, (875), 6 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:02,318 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:02,318 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:02,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:36:02,319 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:36:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:02,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1806985685, now seen corresponding path program 1 times [2021-03-26 00:36:02,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:02,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13656930] [2021-03-26 00:36:02,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:02,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:02,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:36:02,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:02,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:02,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13656930] [2021-03-26 00:36:02,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:02,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:36:02,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652202642] [2021-03-26 00:36:02,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:36:02,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:02,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:36:02,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:36:02,393 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 176 [2021-03-26 00:36:02,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:02,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:02,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 176 [2021-03-26 00:36:02,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:02,425 INFO L129 PetriNetUnfolder]: 45/152 cut-off events. [2021-03-26 00:36:02,425 INFO L130 PetriNetUnfolder]: For 411/452 co-relation queries the response was YES. [2021-03-26 00:36:02,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 152 events. 45/152 cut-off events. For 411/452 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 750 event pairs, 0 based on Foata normal form. 7/151 useless extension candidates. Maximal degree in co-relation 583. Up to 75 conditions per place. [2021-03-26 00:36:02,426 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 3 selfloop transitions, 2 changer transitions 8/34 dead transitions. [2021-03-26 00:36:02,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 34 transitions, 266 flow [2021-03-26 00:36:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:36:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:36:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2021-03-26 00:36:02,428 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8598484848484849 [2021-03-26 00:36:02,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2021-03-26 00:36:02,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2021-03-26 00:36:02,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:02,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2021-03-26 00:36:02,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:02,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:02,430 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:02,430 INFO L185 Difference]: Start difference. First operand has 56 places, 35 transitions, 266 flow. Second operand 3 states and 454 transitions. [2021-03-26 00:36:02,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 34 transitions, 266 flow [2021-03-26 00:36:02,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 34 transitions, 223 flow, removed 11 selfloop flow, removed 9 redundant places. [2021-03-26 00:36:02,434 INFO L241 Difference]: Finished difference. Result has 49 places, 26 transitions, 153 flow [2021-03-26 00:36:02,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=49, PETRI_TRANSITIONS=26} [2021-03-26 00:36:02,434 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2021-03-26 00:36:02,434 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:02,435 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 26 transitions, 153 flow [2021-03-26 00:36:02,435 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 26 transitions, 153 flow [2021-03-26 00:36:02,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 26 transitions, 153 flow [2021-03-26 00:36:02,440 INFO L129 PetriNetUnfolder]: 12/45 cut-off events. [2021-03-26 00:36:02,440 INFO L130 PetriNetUnfolder]: For 46/47 co-relation queries the response was YES. [2021-03-26 00:36:02,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 45 events. 12/45 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 99 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 127. Up to 16 conditions per place. [2021-03-26 00:36:02,441 INFO L142 LiptonReduction]: Number of co-enabled transitions 64 [2021-03-26 00:36:02,757 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:36:02,899 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:36:03,601 WARN L205 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:36:03,875 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:36:05,198 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-26 00:36:05,783 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 00:36:06,398 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:36:06,663 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:36:07,905 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:36:08,529 WARN L205 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:36:08,533 INFO L154 LiptonReduction]: Checked pairs total: 14 [2021-03-26 00:36:08,533 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:36:08,533 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6099 [2021-03-26 00:36:08,534 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 24 transitions, 148 flow [2021-03-26 00:36:08,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:08,534 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:08,534 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:08,534 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:36:08,534 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:36:08,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1942090285, now seen corresponding path program 1 times [2021-03-26 00:36:08,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:08,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400300299] [2021-03-26 00:36:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:36:08,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:08,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:36:08,615 INFO L142 QuantifierPusher]: treesize reduction 4, result has 89.7 percent of original size [2021-03-26 00:36:08,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-26 00:36:08,642 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-26 00:36:08,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 00:36:08,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:08,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:36:08,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:36:08,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:36:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:36:08,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400300299] [2021-03-26 00:36:08,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:36:08,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:36:08,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933430709] [2021-03-26 00:36:08,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:36:08,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:36:08,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:36:08,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:36:08,684 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 179 [2021-03-26 00:36:08,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 24 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:08,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:36:08,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 179 [2021-03-26 00:36:08,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:36:08,775 INFO L129 PetriNetUnfolder]: 14/51 cut-off events. [2021-03-26 00:36:08,775 INFO L130 PetriNetUnfolder]: For 128/134 co-relation queries the response was YES. [2021-03-26 00:36:08,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 51 events. 14/51 cut-off events. For 128/134 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 142 event pairs, 1 based on Foata normal form. 6/56 useless extension candidates. Maximal degree in co-relation 164. Up to 18 conditions per place. [2021-03-26 00:36:08,777 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 4 selfloop transitions, 3 changer transitions 3/25 dead transitions. [2021-03-26 00:36:08,777 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 25 transitions, 172 flow [2021-03-26 00:36:08,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:36:08,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:36:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions. [2021-03-26 00:36:08,780 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6955307262569832 [2021-03-26 00:36:08,780 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 747 transitions. [2021-03-26 00:36:08,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions. [2021-03-26 00:36:08,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:36:08,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions. [2021-03-26 00:36:08,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:08,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:08,784 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:08,784 INFO L185 Difference]: Start difference. First operand has 44 places, 24 transitions, 148 flow. Second operand 6 states and 747 transitions. [2021-03-26 00:36:08,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 25 transitions, 172 flow [2021-03-26 00:36:08,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 25 transitions, 145 flow, removed 5 selfloop flow, removed 8 redundant places. [2021-03-26 00:36:08,785 INFO L241 Difference]: Finished difference. Result has 42 places, 21 transitions, 112 flow [2021-03-26 00:36:08,785 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=21} [2021-03-26 00:36:08,786 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2021-03-26 00:36:08,786 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:36:08,786 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 21 transitions, 112 flow [2021-03-26 00:36:08,786 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 21 transitions, 112 flow [2021-03-26 00:36:08,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 21 transitions, 112 flow [2021-03-26 00:36:08,789 INFO L129 PetriNetUnfolder]: 5/24 cut-off events. [2021-03-26 00:36:08,789 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-03-26 00:36:08,790 INFO L84 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 24 events. 5/24 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 63. Up to 8 conditions per place. [2021-03-26 00:36:08,790 INFO L142 LiptonReduction]: Number of co-enabled transitions 26 [2021-03-26 00:36:09,052 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2021-03-26 00:36:09,518 WARN L205 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2021-03-26 00:36:09,637 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 00:36:09,744 INFO L154 LiptonReduction]: Checked pairs total: 49 [2021-03-26 00:36:09,745 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:36:09,745 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 959 [2021-03-26 00:36:09,745 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 116 flow [2021-03-26 00:36:09,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:36:09,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:36:09,746 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:36:09,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:36:09,746 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:36:09,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:36:09,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1764502495, now seen corresponding path program 1 times [2021-03-26 00:36:09,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:36:09,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105513036] [2021-03-26 00:36:09,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:36:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:36:09,775 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:36:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:36:09,808 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:36:09,845 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:36:09,845 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:36:09,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:36:09,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:36:09 BasicIcfg [2021-03-26 00:36:09,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:36:09,940 INFO L168 Benchmark]: Toolchain (without parser) took 19298.60 ms. Allocated memory was 255.9 MB in the beginning and 650.1 MB in the end (delta: 394.3 MB). Free memory was 235.1 MB in the beginning and 495.6 MB in the end (delta: -260.5 MB). Peak memory consumption was 133.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:09,940 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:36:09,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.82 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 234.7 MB in the beginning and 329.3 MB in the end (delta: -94.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:09,941 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.92 ms. Allocated memory is still 369.1 MB. Free memory was 329.3 MB in the beginning and 326.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:09,942 INFO L168 Benchmark]: Boogie Preprocessor took 55.57 ms. Allocated memory is still 369.1 MB. Free memory was 326.3 MB in the beginning and 324.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:09,942 INFO L168 Benchmark]: RCFGBuilder took 1662.25 ms. Allocated memory is still 369.1 MB. Free memory was 324.2 MB in the beginning and 327.9 MB in the end (delta: -3.7 MB). Peak memory consumption was 65.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:09,942 INFO L168 Benchmark]: TraceAbstraction took 16894.16 ms. Allocated memory was 369.1 MB in the beginning and 650.1 MB in the end (delta: 281.0 MB). Free memory was 327.9 MB in the beginning and 495.6 MB in the end (delta: -167.7 MB). Peak memory consumption was 113.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:36:09,948 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.44 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 610.82 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 234.7 MB in the beginning and 329.3 MB in the end (delta: -94.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 70.92 ms. Allocated memory is still 369.1 MB. Free memory was 329.3 MB in the beginning and 326.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 55.57 ms. Allocated memory is still 369.1 MB. Free memory was 326.3 MB in the beginning and 324.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1662.25 ms. Allocated memory is still 369.1 MB. Free memory was 324.2 MB in the beginning and 327.9 MB in the end (delta: -3.7 MB). Peak memory consumption was 65.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16894.16 ms. Allocated memory was 369.1 MB in the beginning and 650.1 MB in the end (delta: 281.0 MB). Free memory was 327.9 MB in the beginning and 495.6 MB in the end (delta: -167.7 MB). Peak memory consumption was 113.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2928.7ms, 102 PlacesBefore, 46 PlacesAfterwards, 94 TransitionsBefore, 37 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 4 FixpointIterations, 28 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 63 TotalNumberOfCompositions, 2292 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1285, positive: 1231, positive conditional: 1231, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1046, positive: 1013, positive conditional: 0, positive unconditional: 1013, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1046, positive: 1013, positive conditional: 0, positive unconditional: 1013, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1046, positive: 1007, positive conditional: 0, positive unconditional: 1007, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 499, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 486, negative conditional: 0, negative unconditional: 486, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1285, positive: 218, positive conditional: 218, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 1046, unknown conditional: 1046, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 35, Positive conditional cache size: 35, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2287.4ms, 43 PlacesBefore, 32 PlacesAfterwards, 34 TransitionsBefore, 23 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 5 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1420 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 453, positive: 357, positive conditional: 357, positive unconditional: 0, negative: 96, negative conditional: 96, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 101, positive conditional: 5, positive unconditional: 96, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 108, positive: 101, positive conditional: 5, positive unconditional: 96, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 108, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 88, negative conditional: 46, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 453, positive: 256, positive conditional: 256, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 108, unknown conditional: 108, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 68, Positive conditional cache size: 68, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.1ms, 35 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 11, positive conditional: 3, positive unconditional: 8, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 73, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 79, Positive conditional cache size: 79, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.5ms, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 3, positive unconditional: 12, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 3, positive unconditional: 12, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 2, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 57, negative conditional: 4, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 94, Positive conditional cache size: 94, Positive unconditional cache size: 0, Negative cache size: 33, Negative conditional cache size: 33, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.7ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 187 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 42, positive conditional: 12, positive unconditional: 30, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, positive: 42, positive conditional: 12, positive unconditional: 30, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 45, unknown conditional: 45, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 136, Positive conditional cache size: 136, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.8ms, 39 PlacesBefore, 39 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 193 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 23, positive conditional: 20, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 23, positive conditional: 20, positive unconditional: 3, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 159, Positive conditional cache size: 159, Positive unconditional cache size: 0, Negative cache size: 37, Negative conditional cache size: 37, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 178.1ms, 47 PlacesBefore, 45 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 27, positive conditional: 15, positive unconditional: 12, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, positive: 27, positive conditional: 15, positive unconditional: 12, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 163, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 163, negative conditional: 0, negative unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 186, Positive conditional cache size: 186, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.8ms, 45 PlacesBefore, 45 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 421 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 168, positive: 136, positive conditional: 136, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 32, positive conditional: 24, positive unconditional: 8, 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: 32, positive: 32, positive conditional: 24, positive unconditional: 8, 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: 32, positive: 32, positive conditional: 0, positive unconditional: 32, 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: 168, positive: 104, positive conditional: 104, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 194, Positive conditional cache size: 194, Positive unconditional cache size: 0, Negative cache size: 39, Negative conditional cache size: 39, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 102.4ms, 48 PlacesBefore, 48 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 171 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 3, positive unconditional: 5, 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: 10, positive: 8, positive conditional: 3, positive unconditional: 5, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 74, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 202, Positive conditional cache size: 202, Positive unconditional cache size: 0, Negative cache size: 41, Negative conditional cache size: 41, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.0ms, 55 PlacesBefore, 54 PlacesAfterwards, 35 TransitionsBefore, 33 TransitionsAfterwards, 248 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 320 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 27, positive conditional: 27, 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: 27, positive: 27, positive conditional: 27, 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: 27, positive: 27, positive conditional: 0, positive unconditional: 27, 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: 58, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 27, unknown conditional: 27, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 178, Positive conditional cache size: 178, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 148.7ms, 56 PlacesBefore, 55 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 161, Positive conditional cache size: 161, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1012.5ms, 60 PlacesBefore, 56 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 123, Positive conditional cache size: 123, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6098.4ms, 49 PlacesBefore, 44 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, 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: 7, positive: 7, positive conditional: 7, 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: 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: 14, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 9, Negative conditional cache size: 9, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 958.7ms, 42 PlacesBefore, 40 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 49 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 132, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 104, negative conditional: 104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 55, Positive conditional cache size: 55, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1900; [L832] FCALL, FORK 0 pthread_create(&t1900, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L833] 0 pthread_t t1901; [L834] FCALL, FORK 0 pthread_create(&t1901, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L835] 0 pthread_t t1902; [L836] FCALL, FORK 0 pthread_create(&t1902, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 3 __unbuffered_p2_EAX = y [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] 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) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] 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) [L809] 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) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 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 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 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 [L744] 1 y = 2 [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=51, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 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) [L789] 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) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 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 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 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 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L842] 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) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] 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) [L842] 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) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 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 [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 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 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=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=1, 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: 5.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16701.1ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1044.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2996.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 63 SDtfs, 39 SDslu, 34 SDs, 0 SdLazy, 254 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 280.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 344.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=11, InterpolantAutomatonStates: 67, 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: 39.1ms SsaConstructionTime, 458.3ms SatisfiabilityAnalysisTime, 791.2ms InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 877 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...