/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/safe027_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:47:09,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:47:09,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:47:09,256 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:47:09,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:47:09,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:47:09,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:47:09,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:47:09,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:47:09,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:47:09,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:47:09,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:47:09,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:47:09,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:47:09,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:47:09,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:47:09,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:47:09,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:47:09,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:47:09,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:47:09,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:47:09,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:47:09,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:47:09,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:47:09,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:47:09,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:47:09,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:47:09,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:47:09,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:47:09,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:47:09,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:47:09,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:47:09,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:47:09,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:47:09,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:47:09,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:47:09,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:47:09,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:47:09,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:47:09,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:47:09,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:47:09,315 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:47:09,349 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:47:09,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:47:09,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:47:09,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:47:09,353 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:47:09,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:47:09,353 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:47:09,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:47:09,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:47:09,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:47:09,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:47:09,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:47:09,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:47:09,355 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:47:09,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:47:09,355 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:47:09,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:47:09,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:47:09,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:47:09,356 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:47:09,356 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:47:09,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:47:09,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:47:09,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:47:09,357 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:47:09,357 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:47:09,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:47:09,358 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:47:09,358 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:47:09,358 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:47:09,358 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:47:09,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:47:09,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:47:09,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:47:09,713 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:47:09,713 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:47:09,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_rmo.opt.i [2021-03-26 00:47:09,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca36cc9e/fca65c38028442c5a63c6ec31dfc61ed/FLAG93821bf36 [2021-03-26 00:47:10,275 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:47:10,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_rmo.opt.i [2021-03-26 00:47:10,304 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca36cc9e/fca65c38028442c5a63c6ec31dfc61ed/FLAG93821bf36 [2021-03-26 00:47:10,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cca36cc9e/fca65c38028442c5a63c6ec31dfc61ed [2021-03-26 00:47:10,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:47:10,800 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:47:10,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:47:10,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:47:10,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:47:10,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:47:10" (1/1) ... [2021-03-26 00:47:10,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6c95d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:10, skipping insertion in model container [2021-03-26 00:47:10,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:47:10" (1/1) ... [2021-03-26 00:47:10,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:47:10,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:47:10,981 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/safe027_rmo.opt.i[992,1005] [2021-03-26 00:47:11,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:47:11,169 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:47:11,180 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/safe027_rmo.opt.i[992,1005] [2021-03-26 00:47:11,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:47:11,311 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:47:11,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:11 WrapperNode [2021-03-26 00:47:11,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:47:11,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:47:11,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:47:11,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:47:11,319 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:47:11" (1/1) ... [2021-03-26 00:47:11,339 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:47:11" (1/1) ... [2021-03-26 00:47:11,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:47:11,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:47:11,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:47:11,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:47:11,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:11" (1/1) ... [2021-03-26 00:47:11,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:11" (1/1) ... [2021-03-26 00:47:11,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:11" (1/1) ... [2021-03-26 00:47:11,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:11" (1/1) ... [2021-03-26 00:47:11,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:11" (1/1) ... [2021-03-26 00:47:11,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:11" (1/1) ... [2021-03-26 00:47:11,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:11" (1/1) ... [2021-03-26 00:47:11,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:47:11,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:47:11,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:47:11,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:47:11,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:11" (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:47:11,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 00:47:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:47:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:47:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:47:11,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:47:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:47:11,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:47:11,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:47:11,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:47:11,522 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:47:11,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:47:11,522 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:47:11,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:47:11,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:47:11,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:47:11,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:47:11,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:47:11,524 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:47:13,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:47:13,467 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-26 00:47:13,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:47:13 BoogieIcfgContainer [2021-03-26 00:47:13,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:47:13,470 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:47:13,470 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:47:13,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:47:13,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:47:10" (1/3) ... [2021-03-26 00:47:13,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544a80b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:47:13, skipping insertion in model container [2021-03-26 00:47:13,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:47:11" (2/3) ... [2021-03-26 00:47:13,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544a80b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:47:13, skipping insertion in model container [2021-03-26 00:47:13,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:47:13" (3/3) ... [2021-03-26 00:47:13,475 INFO L111 eAbstractionObserver]: Analyzing ICFG safe027_rmo.opt.i [2021-03-26 00:47:13,481 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:47:13,485 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 00:47:13,485 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:47:13,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,528 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,548 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,548 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,548 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,548 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,549 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,549 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,550 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,550 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,564 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,564 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,564 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,564 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,566 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,567 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,568 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,572 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,575 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,576 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,576 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,576 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,578 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,578 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,579 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,579 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,580 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,582 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,582 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:47:13,583 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:47:13,599 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 00:47:13,616 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:47:13,616 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:47:13,616 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:47:13,616 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:47:13,616 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:47:13,617 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:47:13,617 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:47:13,617 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:47:13,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-03-26 00:47:13,722 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-03-26 00:47:13,723 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:47:13,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2021-03-26 00:47:13,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2021-03-26 00:47:13,741 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 111 transitions, 234 flow [2021-03-26 00:47:13,743 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:13,752 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 111 transitions, 234 flow [2021-03-26 00:47:13,757 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 111 transitions, 234 flow [2021-03-26 00:47:13,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 111 transitions, 234 flow [2021-03-26 00:47:13,797 INFO L129 PetriNetUnfolder]: 1/111 cut-off events. [2021-03-26 00:47:13,797 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:47:13,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 1/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2021-03-26 00:47:13,802 INFO L142 LiptonReduction]: Number of co-enabled transitions 1358 [2021-03-26 00:47:15,113 WARN L205 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2021-03-26 00:47:15,402 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-03-26 00:47:16,873 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 322 DAG size of output: 277 [2021-03-26 00:47:17,529 WARN L205 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 274 [2021-03-26 00:47:17,712 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-26 00:47:18,143 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2021-03-26 00:47:18,273 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-26 00:47:22,034 INFO L154 LiptonReduction]: Checked pairs total: 1686 [2021-03-26 00:47:22,035 INFO L156 LiptonReduction]: Total number of compositions: 70 [2021-03-26 00:47:22,039 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8297 [2021-03-26 00:47:22,052 INFO L129 PetriNetUnfolder]: 1/43 cut-off events. [2021-03-26 00:47:22,052 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:47:22,053 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:22,053 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:22,053 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:22,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:22,060 INFO L82 PathProgramCache]: Analyzing trace with hash -743590034, now seen corresponding path program 1 times [2021-03-26 00:47:22,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:22,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179020180] [2021-03-26 00:47:22,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:22,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:22,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:22,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:22,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:22,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:22,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:22,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:22,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:47:22,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:22,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:47:22,388 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:47:22,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179020180] [2021-03-26 00:47:22,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:22,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:47:22,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950545525] [2021-03-26 00:47:22,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:47:22,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:22,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:47:22,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:47:22,409 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 199 [2021-03-26 00:47:22,414 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:22,414 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:22,414 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 199 [2021-03-26 00:47:22,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:22,456 INFO L129 PetriNetUnfolder]: 0/46 cut-off events. [2021-03-26 00:47:22,457 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:47:22,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 46 events. 0/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 4/49 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 00:47:22,458 INFO L132 encePairwiseOnDemand]: 194/199 looper letters, 2 selfloop transitions, 2 changer transitions 3/44 dead transitions. [2021-03-26 00:47:22,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 112 flow [2021-03-26 00:47:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:47:22,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:47:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 920 transitions. [2021-03-26 00:47:22,475 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9246231155778895 [2021-03-26 00:47:22,476 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 920 transitions. [2021-03-26 00:47:22,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 920 transitions. [2021-03-26 00:47:22,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:22,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 920 transitions. [2021-03-26 00:47:22,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:47:22,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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:47:22,498 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states 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:47:22,500 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 5 states and 920 transitions. [2021-03-26 00:47:22,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 112 flow [2021-03-26 00:47:22,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:47:22,504 INFO L241 Difference]: Finished difference. Result has 58 places, 41 transitions, 102 flow [2021-03-26 00:47:22,506 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2021-03-26 00:47:22,506 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2021-03-26 00:47:22,506 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:22,507 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 41 transitions, 102 flow [2021-03-26 00:47:22,508 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 41 transitions, 102 flow [2021-03-26 00:47:22,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 41 transitions, 102 flow [2021-03-26 00:47:22,518 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-26 00:47:22,519 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 00:47:22,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 41 events. 0/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:47:22,519 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-26 00:47:25,467 INFO L154 LiptonReduction]: Checked pairs total: 897 [2021-03-26 00:47:25,467 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-26 00:47:25,467 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2961 [2021-03-26 00:47:25,469 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 72 flow [2021-03-26 00:47:25,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 182.8) internal successors, (914), 5 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:25,469 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:25,469 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:25,470 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:47:25,470 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:25,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1576491683, now seen corresponding path program 1 times [2021-03-26 00:47:25,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:25,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566232165] [2021-03-26 00:47:25,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:25,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:25,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:25,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:25,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:25,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:25,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:25,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:25,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:47:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:47:25,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566232165] [2021-03-26 00:47:25,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:25,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:47:25,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093816510] [2021-03-26 00:47:25,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:47:25,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:25,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:47:25,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:47:25,586 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 214 [2021-03-26 00:47:25,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states 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:47:25,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:25,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 214 [2021-03-26 00:47:25,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:25,620 INFO L129 PetriNetUnfolder]: 5/46 cut-off events. [2021-03-26 00:47:25,620 INFO L130 PetriNetUnfolder]: For 55/79 co-relation queries the response was YES. [2021-03-26 00:47:25,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 46 events. 5/46 cut-off events. For 55/79 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 136 event pairs, 1 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 76. Up to 7 conditions per place. [2021-03-26 00:47:25,621 INFO L132 encePairwiseOnDemand]: 209/214 looper letters, 4 selfloop transitions, 4 changer transitions 1/29 dead transitions. [2021-03-26 00:47:25,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 99 flow [2021-03-26 00:47:25,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:47:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:47:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 755 transitions. [2021-03-26 00:47:25,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8820093457943925 [2021-03-26 00:47:25,623 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 755 transitions. [2021-03-26 00:47:25,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 755 transitions. [2021-03-26 00:47:25,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:25,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 755 transitions. [2021-03-26 00:47:25,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 188.75) internal successors, (755), 4 states have internal predecessors, (755), 0 states have call successors, (0), 0 states 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:47:25,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states 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:47:25,630 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states 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:47:25,630 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 72 flow. Second operand 4 states and 755 transitions. [2021-03-26 00:47:25,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 99 flow [2021-03-26 00:47:25,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 89 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 00:47:25,631 INFO L241 Difference]: Finished difference. Result has 41 places, 26 transitions, 82 flow [2021-03-26 00:47:25,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2021-03-26 00:47:25,632 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -15 predicate places. [2021-03-26 00:47:25,632 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:25,632 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 82 flow [2021-03-26 00:47:25,633 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 82 flow [2021-03-26 00:47:25,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 26 transitions, 82 flow [2021-03-26 00:47:25,637 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-26 00:47:25,637 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-26 00:47:25,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 26 events. 0/26 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 00:47:25,638 INFO L142 LiptonReduction]: Number of co-enabled transitions 210 [2021-03-26 00:47:26,067 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:47:26,566 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2021-03-26 00:47:26,780 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2021-03-26 00:47:26,963 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2021-03-26 00:47:27,135 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2021-03-26 00:47:27,788 WARN L205 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 169 [2021-03-26 00:47:28,108 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-26 00:47:28,730 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 169 [2021-03-26 00:47:29,063 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 165 [2021-03-26 00:47:29,068 INFO L154 LiptonReduction]: Checked pairs total: 788 [2021-03-26 00:47:29,068 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:47:29,068 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3436 [2021-03-26 00:47:29,069 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 72 flow [2021-03-26 00:47:29,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states 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:47:29,070 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:29,070 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:47:29,070 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:47:29,070 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:29,071 INFO L82 PathProgramCache]: Analyzing trace with hash -967568625, now seen corresponding path program 1 times [2021-03-26 00:47:29,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:29,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257978799] [2021-03-26 00:47:29,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:29,178 INFO L142 QuantifierPusher]: treesize reduction 10, result has 28.6 percent of original size [2021-03-26 00:47:29,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:47:29,182 INFO L142 QuantifierPusher]: treesize reduction 10, result has 44.4 percent of original size [2021-03-26 00:47:29,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 00:47:29,188 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:47:29,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257978799] [2021-03-26 00:47:29,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:29,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:47:29,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274642689] [2021-03-26 00:47:29,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:47:29,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:29,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:47:29,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:47:29,192 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 218 [2021-03-26 00:47:29,193 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states 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:47:29,193 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:29,193 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 218 [2021-03-26 00:47:29,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:29,217 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 00:47:29,217 INFO L130 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2021-03-26 00:47:29,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 22 events. 0/22 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-26 00:47:29,218 INFO L132 encePairwiseOnDemand]: 215/218 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-26 00:47:29,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 22 transitions, 78 flow [2021-03-26 00:47:29,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:47:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:47:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 595 transitions. [2021-03-26 00:47:29,220 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9097859327217125 [2021-03-26 00:47:29,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 595 transitions. [2021-03-26 00:47:29,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 595 transitions. [2021-03-26 00:47:29,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:29,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 595 transitions. [2021-03-26 00:47:29,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:47:29,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states 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:47:29,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states 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:47:29,225 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 72 flow. Second operand 3 states and 595 transitions. [2021-03-26 00:47:29,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 22 transitions, 78 flow [2021-03-26 00:47:29,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 22 transitions, 64 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-26 00:47:29,226 INFO L241 Difference]: Finished difference. Result has 36 places, 22 transitions, 66 flow [2021-03-26 00:47:29,226 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2021-03-26 00:47:29,226 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -20 predicate places. [2021-03-26 00:47:29,226 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:29,227 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 22 transitions, 66 flow [2021-03-26 00:47:29,227 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 22 transitions, 66 flow [2021-03-26 00:47:29,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 22 transitions, 66 flow [2021-03-26 00:47:29,232 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 00:47:29,232 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:47:29,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:47:29,233 INFO L142 LiptonReduction]: Number of co-enabled transitions 208 [2021-03-26 00:47:29,234 INFO L154 LiptonReduction]: Checked pairs total: 180 [2021-03-26 00:47:29,234 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:29,234 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-26 00:47:29,235 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 66 flow [2021-03-26 00:47:29,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states 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:47:29,236 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:29,236 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:29,236 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:47:29,237 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:29,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1078542993, now seen corresponding path program 1 times [2021-03-26 00:47:29,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:29,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051023925] [2021-03-26 00:47:29,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:29,398 INFO L142 QuantifierPusher]: treesize reduction 13, result has 81.4 percent of original size [2021-03-26 00:47:29,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-26 00:47:29,448 INFO L142 QuantifierPusher]: treesize reduction 18, result has 76.0 percent of original size [2021-03-26 00:47:29,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-26 00:47:29,456 INFO L142 QuantifierPusher]: treesize reduction 22, result has 70.3 percent of original size [2021-03-26 00:47:29,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 00:47:29,501 INFO L142 QuantifierPusher]: treesize reduction 11, result has 83.8 percent of original size [2021-03-26 00:47:29,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-26 00:47:29,552 INFO L142 QuantifierPusher]: treesize reduction 16, result has 71.9 percent of original size [2021-03-26 00:47:29,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 00:47:29,585 INFO L142 QuantifierPusher]: treesize reduction 9, result has 62.5 percent of original size [2021-03-26 00:47:29,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:47:29,598 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:47:29,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051023925] [2021-03-26 00:47:29,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:29,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:47:29,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708174053] [2021-03-26 00:47:29,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:47:29,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:29,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:47:29,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:47:29,603 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 218 [2021-03-26 00:47:29,604 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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:47:29,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:29,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 218 [2021-03-26 00:47:29,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:29,769 INFO L129 PetriNetUnfolder]: 46/123 cut-off events. [2021-03-26 00:47:29,770 INFO L130 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2021-03-26 00:47:29,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 123 events. 46/123 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 449 event pairs, 9 based on Foata normal form. 1/121 useless extension candidates. Maximal degree in co-relation 268. Up to 71 conditions per place. [2021-03-26 00:47:29,772 INFO L132 encePairwiseOnDemand]: 210/218 looper letters, 13 selfloop transitions, 9 changer transitions 0/34 dead transitions. [2021-03-26 00:47:29,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 141 flow [2021-03-26 00:47:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:47:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:47:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2021-03-26 00:47:29,779 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6410550458715596 [2021-03-26 00:47:29,780 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2021-03-26 00:47:29,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2021-03-26 00:47:29,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:29,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2021-03-26 00:47:29,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states 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:47:29,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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:47:29,787 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states 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:47:29,787 INFO L185 Difference]: Start difference. First operand has 36 places, 22 transitions, 66 flow. Second operand 4 states and 559 transitions. [2021-03-26 00:47:29,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 141 flow [2021-03-26 00:47:29,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 135 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:47:29,790 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 124 flow [2021-03-26 00:47:29,791 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2021-03-26 00:47:29,791 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -17 predicate places. [2021-03-26 00:47:29,791 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:29,791 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 124 flow [2021-03-26 00:47:29,792 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 124 flow [2021-03-26 00:47:29,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 124 flow [2021-03-26 00:47:29,804 INFO L129 PetriNetUnfolder]: 9/65 cut-off events. [2021-03-26 00:47:29,804 INFO L130 PetriNetUnfolder]: For 11/12 co-relation queries the response was YES. [2021-03-26 00:47:29,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 65 events. 9/65 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 243 event pairs, 0 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 131. Up to 14 conditions per place. [2021-03-26 00:47:29,809 INFO L142 LiptonReduction]: Number of co-enabled transitions 282 [2021-03-26 00:47:30,656 WARN L205 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 194 [2021-03-26 00:47:31,007 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2021-03-26 00:47:32,377 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 318 DAG size of output: 273 [2021-03-26 00:47:33,002 WARN L205 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-26 00:47:33,109 INFO L154 LiptonReduction]: Checked pairs total: 456 [2021-03-26 00:47:33,109 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:47:33,109 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3318 [2021-03-26 00:47:33,110 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 126 flow [2021-03-26 00:47:33,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 135.0) internal successors, (945), 7 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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:47:33,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:33,111 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:33,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:47:33,111 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:33,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:33,111 INFO L82 PathProgramCache]: Analyzing trace with hash 217051113, now seen corresponding path program 2 times [2021-03-26 00:47:33,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:33,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418712201] [2021-03-26 00:47:33,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:33,187 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.2 percent of original size [2021-03-26 00:47:33,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-26 00:47:33,225 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.2 percent of original size [2021-03-26 00:47:33,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-03-26 00:47:33,268 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-26 00:47:33,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 00:47:33,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:33,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 00:47:33,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:33,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 00:47:33,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:33,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:47:33,353 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:47:33,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418712201] [2021-03-26 00:47:33,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:33,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:47:33,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929261128] [2021-03-26 00:47:33,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:47:33,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:33,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:47:33,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:47:33,356 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 219 [2021-03-26 00:47:33,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 137.875) internal successors, (1103), 8 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states 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:47:33,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:33,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 219 [2021-03-26 00:47:33,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:33,560 INFO L129 PetriNetUnfolder]: 44/120 cut-off events. [2021-03-26 00:47:33,560 INFO L130 PetriNetUnfolder]: For 86/95 co-relation queries the response was YES. [2021-03-26 00:47:33,561 INFO L84 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 120 events. 44/120 cut-off events. For 86/95 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 444 event pairs, 6 based on Foata normal form. 9/127 useless extension candidates. Maximal degree in co-relation 331. Up to 69 conditions per place. [2021-03-26 00:47:33,562 INFO L132 encePairwiseOnDemand]: 213/219 looper letters, 17 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-03-26 00:47:33,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 202 flow [2021-03-26 00:47:33,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:47:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:47:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2021-03-26 00:47:33,567 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6518264840182648 [2021-03-26 00:47:33,567 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2021-03-26 00:47:33,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2021-03-26 00:47:33,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:33,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2021-03-26 00:47:33,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:47:33,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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:47:33,571 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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:47:33,572 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 126 flow. Second operand 4 states and 571 transitions. [2021-03-26 00:47:33,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 202 flow [2021-03-26 00:47:33,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:47:33,573 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 159 flow [2021-03-26 00:47:33,574 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-03-26 00:47:33,574 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -13 predicate places. [2021-03-26 00:47:33,574 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:33,574 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 159 flow [2021-03-26 00:47:33,574 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 159 flow [2021-03-26 00:47:33,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 159 flow [2021-03-26 00:47:33,583 INFO L129 PetriNetUnfolder]: 9/65 cut-off events. [2021-03-26 00:47:33,583 INFO L130 PetriNetUnfolder]: For 46/55 co-relation queries the response was YES. [2021-03-26 00:47:33,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 65 events. 9/65 cut-off events. For 46/55 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 245 event pairs, 1 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 151. Up to 15 conditions per place. [2021-03-26 00:47:33,584 INFO L142 LiptonReduction]: Number of co-enabled transitions 298 [2021-03-26 00:47:34,401 WARN L205 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 194 [2021-03-26 00:47:34,703 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 192 [2021-03-26 00:47:36,137 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 318 DAG size of output: 274 [2021-03-26 00:47:36,767 WARN L205 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2021-03-26 00:47:37,478 WARN L205 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 193 [2021-03-26 00:47:37,776 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-26 00:47:39,269 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 318 DAG size of output: 274 [2021-03-26 00:47:39,861 WARN L205 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2021-03-26 00:47:39,880 INFO L154 LiptonReduction]: Checked pairs total: 484 [2021-03-26 00:47:39,880 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:47:39,880 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6306 [2021-03-26 00:47:39,881 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 163 flow [2021-03-26 00:47:39,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 137.875) internal successors, (1103), 8 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states 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:47:39,882 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:39,882 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:39,882 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:47:39,882 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:39,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:39,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1466976548, now seen corresponding path program 1 times [2021-03-26 00:47:39,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:39,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576065810] [2021-03-26 00:47:39,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:39,998 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-26 00:47:39,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 00:47:40,027 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-26 00:47:40,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 00:47:40,061 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-26 00:47:40,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 00:47:40,066 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-26 00:47:40,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 00:47:40,098 INFO L142 QuantifierPusher]: treesize reduction 2, result has 92.6 percent of original size [2021-03-26 00:47:40,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:47:40,125 INFO L142 QuantifierPusher]: treesize reduction 15, result has 64.3 percent of original size [2021-03-26 00:47:40,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 00:47:40,133 INFO L142 QuantifierPusher]: treesize reduction 2, result has 88.2 percent of original size [2021-03-26 00:47:40,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:47:40,143 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:47:40,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576065810] [2021-03-26 00:47:40,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:40,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:47:40,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089613858] [2021-03-26 00:47:40,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:47:40,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:40,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:47:40,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:47:40,148 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 221 [2021-03-26 00:47:40,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 137.14285714285714) internal successors, (960), 7 states have internal predecessors, (960), 0 states have call successors, (0), 0 states 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:47:40,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:40,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 221 [2021-03-26 00:47:40,149 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:40,456 INFO L129 PetriNetUnfolder]: 55/169 cut-off events. [2021-03-26 00:47:40,456 INFO L130 PetriNetUnfolder]: For 243/255 co-relation queries the response was YES. [2021-03-26 00:47:40,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 169 events. 55/169 cut-off events. For 243/255 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 765 event pairs, 13 based on Foata normal form. 15/183 useless extension candidates. Maximal degree in co-relation 486. Up to 60 conditions per place. [2021-03-26 00:47:40,458 INFO L132 encePairwiseOnDemand]: 212/221 looper letters, 26 selfloop transitions, 21 changer transitions 0/59 dead transitions. [2021-03-26 00:47:40,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 402 flow [2021-03-26 00:47:40,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:47:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:47:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 989 transitions. [2021-03-26 00:47:40,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6393018745959922 [2021-03-26 00:47:40,463 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 989 transitions. [2021-03-26 00:47:40,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 989 transitions. [2021-03-26 00:47:40,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:40,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 989 transitions. [2021-03-26 00:47:40,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states 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:47:40,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states 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:47:40,468 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states 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:47:40,468 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 163 flow. Second operand 7 states and 989 transitions. [2021-03-26 00:47:40,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 402 flow [2021-03-26 00:47:40,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:47:40,471 INFO L241 Difference]: Finished difference. Result has 52 places, 53 transitions, 367 flow [2021-03-26 00:47:40,471 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2021-03-26 00:47:40,471 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2021-03-26 00:47:40,471 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:40,471 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 53 transitions, 367 flow [2021-03-26 00:47:40,472 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 53 transitions, 367 flow [2021-03-26 00:47:40,472 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 53 transitions, 367 flow [2021-03-26 00:47:40,489 INFO L129 PetriNetUnfolder]: 31/128 cut-off events. [2021-03-26 00:47:40,490 INFO L130 PetriNetUnfolder]: For 277/277 co-relation queries the response was YES. [2021-03-26 00:47:40,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 128 events. 31/128 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 624 event pairs, 1 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 402. Up to 31 conditions per place. [2021-03-26 00:47:40,491 INFO L142 LiptonReduction]: Number of co-enabled transitions 462 [2021-03-26 00:47:41,196 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 193 [2021-03-26 00:47:41,488 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-26 00:47:42,903 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 318 DAG size of output: 274 [2021-03-26 00:47:43,543 WARN L205 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 271 [2021-03-26 00:47:43,551 INFO L154 LiptonReduction]: Checked pairs total: 1089 [2021-03-26 00:47:43,552 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:47:43,552 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3081 [2021-03-26 00:47:43,552 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 369 flow [2021-03-26 00:47:43,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 137.14285714285714) internal successors, (960), 7 states have internal predecessors, (960), 0 states have call successors, (0), 0 states 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:47:43,553 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:43,553 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:43,553 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:47:43,553 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:43,553 INFO L82 PathProgramCache]: Analyzing trace with hash -258613881, now seen corresponding path program 1 times [2021-03-26 00:47:43,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:43,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684247219] [2021-03-26 00:47:43,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:43,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:43,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:43,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:43,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:43,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:43,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:43,602 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:47:43,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684247219] [2021-03-26 00:47:43,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:43,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:47:43,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837285248] [2021-03-26 00:47:43,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:47:43,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:43,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:47:43,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:47:43,604 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 222 [2021-03-26 00:47:43,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 193.75) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 0 states 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:47:43,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:43,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 222 [2021-03-26 00:47:43,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:43,770 INFO L129 PetriNetUnfolder]: 490/869 cut-off events. [2021-03-26 00:47:43,770 INFO L130 PetriNetUnfolder]: For 1298/1415 co-relation queries the response was YES. [2021-03-26 00:47:43,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 869 events. 490/869 cut-off events. For 1298/1415 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 5162 event pairs, 173 based on Foata normal form. 112/906 useless extension candidates. Maximal degree in co-relation 2435. Up to 547 conditions per place. [2021-03-26 00:47:43,778 INFO L132 encePairwiseOnDemand]: 215/222 looper letters, 15 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2021-03-26 00:47:43,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 445 flow [2021-03-26 00:47:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:47:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:47:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 987 transitions. [2021-03-26 00:47:43,782 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8891891891891892 [2021-03-26 00:47:43,782 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 987 transitions. [2021-03-26 00:47:43,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 987 transitions. [2021-03-26 00:47:43,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:43,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 987 transitions. [2021-03-26 00:47:43,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 197.4) internal successors, (987), 5 states have internal predecessors, (987), 0 states have call successors, (0), 0 states 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:47:43,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:47:43,787 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:47:43,787 INFO L185 Difference]: Start difference. First operand has 52 places, 53 transitions, 369 flow. Second operand 5 states and 987 transitions. [2021-03-26 00:47:43,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 445 flow [2021-03-26 00:47:43,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 439 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-26 00:47:43,796 INFO L241 Difference]: Finished difference. Result has 59 places, 62 transitions, 458 flow [2021-03-26 00:47:43,797 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=458, PETRI_PLACES=59, PETRI_TRANSITIONS=62} [2021-03-26 00:47:43,797 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2021-03-26 00:47:43,797 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:43,797 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 62 transitions, 458 flow [2021-03-26 00:47:43,797 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 62 transitions, 458 flow [2021-03-26 00:47:43,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 62 transitions, 458 flow [2021-03-26 00:47:43,878 INFO L129 PetriNetUnfolder]: 455/826 cut-off events. [2021-03-26 00:47:43,878 INFO L130 PetriNetUnfolder]: For 1421/1628 co-relation queries the response was YES. [2021-03-26 00:47:43,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2788 conditions, 826 events. 455/826 cut-off events. For 1421/1628 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 5023 event pairs, 148 based on Foata normal form. 9/758 useless extension candidates. Maximal degree in co-relation 2764. Up to 576 conditions per place. [2021-03-26 00:47:43,889 INFO L142 LiptonReduction]: Number of co-enabled transitions 626 [2021-03-26 00:47:43,901 INFO L154 LiptonReduction]: Checked pairs total: 276 [2021-03-26 00:47:43,901 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:43,901 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 104 [2021-03-26 00:47:43,902 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 458 flow [2021-03-26 00:47:43,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 193.75) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 0 states 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:47:43,902 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:43,902 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:47:43,902 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:47:43,903 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:43,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:43,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1430393876, now seen corresponding path program 1 times [2021-03-26 00:47:43,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:43,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721682766] [2021-03-26 00:47:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:43,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:43,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:43,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:43,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:43,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:43,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:43,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:43,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:43,962 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:47:43,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721682766] [2021-03-26 00:47:43,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:43,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:47:43,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941159313] [2021-03-26 00:47:43,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:47:43,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:43,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:47:43,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:47:43,964 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 222 [2021-03-26 00:47:43,965 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 0 states have call successors, (0), 0 states 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:47:43,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:43,965 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 222 [2021-03-26 00:47:43,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:44,103 INFO L129 PetriNetUnfolder]: 381/733 cut-off events. [2021-03-26 00:47:44,103 INFO L130 PetriNetUnfolder]: For 1863/2815 co-relation queries the response was YES. [2021-03-26 00:47:44,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 733 events. 381/733 cut-off events. For 1863/2815 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 4507 event pairs, 47 based on Foata normal form. 215/891 useless extension candidates. Maximal degree in co-relation 3011. Up to 537 conditions per place. [2021-03-26 00:47:44,110 INFO L132 encePairwiseOnDemand]: 215/222 looper letters, 15 selfloop transitions, 19 changer transitions 0/72 dead transitions. [2021-03-26 00:47:44,110 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 571 flow [2021-03-26 00:47:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:47:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:47:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1382 transitions. [2021-03-26 00:47:44,114 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8893178893178894 [2021-03-26 00:47:44,114 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1382 transitions. [2021-03-26 00:47:44,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1382 transitions. [2021-03-26 00:47:44,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:44,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1382 transitions. [2021-03-26 00:47:44,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 197.42857142857142) internal successors, (1382), 7 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states 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:47:44,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:47:44,120 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:47:44,120 INFO L185 Difference]: Start difference. First operand has 59 places, 62 transitions, 458 flow. Second operand 7 states and 1382 transitions. [2021-03-26 00:47:44,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 571 flow [2021-03-26 00:47:44,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:47:44,126 INFO L241 Difference]: Finished difference. Result has 67 places, 68 transitions, 576 flow [2021-03-26 00:47:44,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=67, PETRI_TRANSITIONS=68} [2021-03-26 00:47:44,127 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2021-03-26 00:47:44,127 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:44,127 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 68 transitions, 576 flow [2021-03-26 00:47:44,127 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 68 transitions, 576 flow [2021-03-26 00:47:44,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 68 transitions, 576 flow [2021-03-26 00:47:44,194 INFO L129 PetriNetUnfolder]: 367/719 cut-off events. [2021-03-26 00:47:44,194 INFO L130 PetriNetUnfolder]: For 2810/3789 co-relation queries the response was YES. [2021-03-26 00:47:44,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3454 conditions, 719 events. 367/719 cut-off events. For 2810/3789 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 4501 event pairs, 40 based on Foata normal form. 20/681 useless extension candidates. Maximal degree in co-relation 3426. Up to 528 conditions per place. [2021-03-26 00:47:44,204 INFO L142 LiptonReduction]: Number of co-enabled transitions 758 [2021-03-26 00:47:44,214 INFO L154 LiptonReduction]: Checked pairs total: 235 [2021-03-26 00:47:44,214 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:44,214 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 87 [2021-03-26 00:47:44,217 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 68 transitions, 576 flow [2021-03-26 00:47:44,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 193.8) internal successors, (969), 5 states have internal predecessors, (969), 0 states have call successors, (0), 0 states 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:47:44,217 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:44,217 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:47:44,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:47:44,217 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:44,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:44,218 INFO L82 PathProgramCache]: Analyzing trace with hash 509414155, now seen corresponding path program 1 times [2021-03-26 00:47:44,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:44,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867512919] [2021-03-26 00:47:44,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:44,339 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.3 percent of original size [2021-03-26 00:47:44,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-03-26 00:47:44,395 INFO L142 QuantifierPusher]: treesize reduction 2, result has 97.3 percent of original size [2021-03-26 00:47:44,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-03-26 00:47:44,397 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-26 00:47:44,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 00:47:44,435 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.6 percent of original size [2021-03-26 00:47:44,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 00:47:44,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:44,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:47:44,478 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:47:44,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867512919] [2021-03-26 00:47:44,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:44,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:47:44,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036587705] [2021-03-26 00:47:44,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:47:44,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:44,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:47:44,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:47:44,484 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 222 [2021-03-26 00:47:44,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 68 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 147.33333333333334) internal successors, (884), 6 states have internal predecessors, (884), 0 states have call successors, (0), 0 states 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:47:44,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:44,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 222 [2021-03-26 00:47:44,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:44,848 INFO L129 PetriNetUnfolder]: 692/1357 cut-off events. [2021-03-26 00:47:44,848 INFO L130 PetriNetUnfolder]: For 6530/8721 co-relation queries the response was YES. [2021-03-26 00:47:44,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6730 conditions, 1357 events. 692/1357 cut-off events. For 6530/8721 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 9641 event pairs, 112 based on Foata normal form. 83/1338 useless extension candidates. Maximal degree in co-relation 6700. Up to 955 conditions per place. [2021-03-26 00:47:44,864 INFO L132 encePairwiseOnDemand]: 210/222 looper letters, 33 selfloop transitions, 26 changer transitions 2/89 dead transitions. [2021-03-26 00:47:44,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 89 transitions, 873 flow [2021-03-26 00:47:44,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:47:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:47:44,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2021-03-26 00:47:44,867 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6810810810810811 [2021-03-26 00:47:44,867 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 756 transitions. [2021-03-26 00:47:44,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 756 transitions. [2021-03-26 00:47:44,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:44,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 756 transitions. [2021-03-26 00:47:44,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states 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:47:44,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:47:44,872 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states 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:47:44,872 INFO L185 Difference]: Start difference. First operand has 67 places, 68 transitions, 576 flow. Second operand 5 states and 756 transitions. [2021-03-26 00:47:44,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 89 transitions, 873 flow [2021-03-26 00:47:44,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 823 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-26 00:47:44,898 INFO L241 Difference]: Finished difference. Result has 70 places, 80 transitions, 707 flow [2021-03-26 00:47:44,898 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=707, PETRI_PLACES=70, PETRI_TRANSITIONS=80} [2021-03-26 00:47:44,898 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2021-03-26 00:47:44,899 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:44,899 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 80 transitions, 707 flow [2021-03-26 00:47:44,899 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 80 transitions, 707 flow [2021-03-26 00:47:44,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 80 transitions, 707 flow [2021-03-26 00:47:45,041 INFO L129 PetriNetUnfolder]: 598/1200 cut-off events. [2021-03-26 00:47:45,041 INFO L130 PetriNetUnfolder]: For 5066/5526 co-relation queries the response was YES. [2021-03-26 00:47:45,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5333 conditions, 1200 events. 598/1200 cut-off events. For 5066/5526 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 8494 event pairs, 84 based on Foata normal form. 23/1125 useless extension candidates. Maximal degree in co-relation 5303. Up to 748 conditions per place. [2021-03-26 00:47:45,058 INFO L142 LiptonReduction]: Number of co-enabled transitions 1020 [2021-03-26 00:47:45,123 INFO L154 LiptonReduction]: Checked pairs total: 440 [2021-03-26 00:47:45,124 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:45,124 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 225 [2021-03-26 00:47:45,124 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 707 flow [2021-03-26 00:47:45,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 147.33333333333334) internal successors, (884), 6 states have internal predecessors, (884), 0 states have call successors, (0), 0 states 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:47:45,125 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:45,125 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:47:45,125 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:47:45,125 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:45,125 INFO L82 PathProgramCache]: Analyzing trace with hash -485862487, now seen corresponding path program 2 times [2021-03-26 00:47:45,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:45,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280904422] [2021-03-26 00:47:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:45,226 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.2 percent of original size [2021-03-26 00:47:45,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-26 00:47:45,267 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.2 percent of original size [2021-03-26 00:47:45,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-03-26 00:47:45,312 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.2 percent of original size [2021-03-26 00:47:45,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-03-26 00:47:45,316 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-26 00:47:45,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-26 00:47:45,358 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-26 00:47:45,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 00:47:45,399 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.6 percent of original size [2021-03-26 00:47:45,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 00:47:45,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:45,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:47:45,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:47:45,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280904422] [2021-03-26 00:47:45,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:45,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:47:45,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362307522] [2021-03-26 00:47:45,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:47:45,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:45,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:47:45,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:47:45,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 222 [2021-03-26 00:47:45,447 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 707 flow. Second operand has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states 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:47:45,447 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:45,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 222 [2021-03-26 00:47:45,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:45,749 INFO L129 PetriNetUnfolder]: 677/1372 cut-off events. [2021-03-26 00:47:45,749 INFO L130 PetriNetUnfolder]: For 7071/7683 co-relation queries the response was YES. [2021-03-26 00:47:45,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6394 conditions, 1372 events. 677/1372 cut-off events. For 7071/7683 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 9845 event pairs, 130 based on Foata normal form. 75/1341 useless extension candidates. Maximal degree in co-relation 6362. Up to 810 conditions per place. [2021-03-26 00:47:45,768 INFO L132 encePairwiseOnDemand]: 217/222 looper letters, 35 selfloop transitions, 34 changer transitions 0/97 dead transitions. [2021-03-26 00:47:45,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 1018 flow [2021-03-26 00:47:45,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:47:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:47:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2021-03-26 00:47:45,771 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6396396396396397 [2021-03-26 00:47:45,771 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2021-03-26 00:47:45,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2021-03-26 00:47:45,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:45,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2021-03-26 00:47:45,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states 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:47:45,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:47:45,774 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:47:45,774 INFO L185 Difference]: Start difference. First operand has 70 places, 80 transitions, 707 flow. Second operand 4 states and 568 transitions. [2021-03-26 00:47:45,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 1018 flow [2021-03-26 00:47:45,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 1015 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 00:47:45,793 INFO L241 Difference]: Finished difference. Result has 74 places, 90 transitions, 910 flow [2021-03-26 00:47:45,794 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=910, PETRI_PLACES=74, PETRI_TRANSITIONS=90} [2021-03-26 00:47:45,794 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2021-03-26 00:47:45,794 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:45,794 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 90 transitions, 910 flow [2021-03-26 00:47:45,794 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 90 transitions, 910 flow [2021-03-26 00:47:45,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 90 transitions, 910 flow [2021-03-26 00:47:45,931 INFO L129 PetriNetUnfolder]: 648/1316 cut-off events. [2021-03-26 00:47:45,931 INFO L130 PetriNetUnfolder]: For 6062/6514 co-relation queries the response was YES. [2021-03-26 00:47:45,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5973 conditions, 1316 events. 648/1316 cut-off events. For 6062/6514 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 9556 event pairs, 88 based on Foata normal form. 28/1243 useless extension candidates. Maximal degree in co-relation 5940. Up to 812 conditions per place. [2021-03-26 00:47:45,955 INFO L142 LiptonReduction]: Number of co-enabled transitions 1144 [2021-03-26 00:47:46,062 INFO L154 LiptonReduction]: Checked pairs total: 549 [2021-03-26 00:47:46,062 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:46,063 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 269 [2021-03-26 00:47:46,065 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 90 transitions, 910 flow [2021-03-26 00:47:46,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states 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:47:46,066 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:46,066 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:47:46,066 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:47:46,066 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:46,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1661968276, now seen corresponding path program 1 times [2021-03-26 00:47:46,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:46,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369016026] [2021-03-26 00:47:46,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:46,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:46,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:47:46,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:46,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 00:47:46,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:46,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:47:46,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:46,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 00:47:46,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:46,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 00:47:46,235 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:47:46,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369016026] [2021-03-26 00:47:46,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:46,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:47:46,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716643888] [2021-03-26 00:47:46,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:47:46,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:46,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:47:46,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:47:46,237 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 222 [2021-03-26 00:47:46,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 90 transitions, 910 flow. Second operand has 7 states, 7 states have (on average 147.14285714285714) internal successors, (1030), 7 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states 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:47:46,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:46,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 222 [2021-03-26 00:47:46,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:46,698 INFO L129 PetriNetUnfolder]: 851/1679 cut-off events. [2021-03-26 00:47:46,699 INFO L130 PetriNetUnfolder]: For 9648/10497 co-relation queries the response was YES. [2021-03-26 00:47:46,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8105 conditions, 1679 events. 851/1679 cut-off events. For 9648/10497 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 12384 event pairs, 165 based on Foata normal form. 80/1623 useless extension candidates. Maximal degree in co-relation 8070. Up to 1038 conditions per place. [2021-03-26 00:47:46,719 INFO L132 encePairwiseOnDemand]: 213/222 looper letters, 63 selfloop transitions, 14 changer transitions 0/105 dead transitions. [2021-03-26 00:47:46,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 1228 flow [2021-03-26 00:47:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:47:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:47:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 905 transitions. [2021-03-26 00:47:46,722 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6794294294294294 [2021-03-26 00:47:46,722 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 905 transitions. [2021-03-26 00:47:46,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 905 transitions. [2021-03-26 00:47:46,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:46,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 905 transitions. [2021-03-26 00:47:46,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states 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:47:46,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states 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:47:46,727 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 222.0) internal successors, (1554), 7 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states 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:47:46,727 INFO L185 Difference]: Start difference. First operand has 74 places, 90 transitions, 910 flow. Second operand 6 states and 905 transitions. [2021-03-26 00:47:46,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 1228 flow [2021-03-26 00:47:46,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 105 transitions, 1197 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:47:46,748 INFO L241 Difference]: Finished difference. Result has 80 places, 97 transitions, 1025 flow [2021-03-26 00:47:46,748 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1025, PETRI_PLACES=80, PETRI_TRANSITIONS=97} [2021-03-26 00:47:46,748 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places. [2021-03-26 00:47:46,748 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:46,749 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 97 transitions, 1025 flow [2021-03-26 00:47:46,749 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 97 transitions, 1025 flow [2021-03-26 00:47:46,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 97 transitions, 1025 flow [2021-03-26 00:47:46,921 INFO L129 PetriNetUnfolder]: 815/1616 cut-off events. [2021-03-26 00:47:46,922 INFO L130 PetriNetUnfolder]: For 8074/8697 co-relation queries the response was YES. [2021-03-26 00:47:46,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7474 conditions, 1616 events. 815/1616 cut-off events. For 8074/8697 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 12039 event pairs, 115 based on Foata normal form. 33/1515 useless extension candidates. Maximal degree in co-relation 7438. Up to 1034 conditions per place. [2021-03-26 00:47:46,950 INFO L142 LiptonReduction]: Number of co-enabled transitions 1272 [2021-03-26 00:47:47,145 INFO L154 LiptonReduction]: Checked pairs total: 660 [2021-03-26 00:47:47,145 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:47,145 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 397 [2021-03-26 00:47:47,146 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 97 transitions, 1025 flow [2021-03-26 00:47:47,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 147.14285714285714) internal successors, (1030), 7 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states 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:47:47,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:47,147 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:47:47,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:47:47,147 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:47,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1267940894, now seen corresponding path program 2 times [2021-03-26 00:47:47,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:47,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621054870] [2021-03-26 00:47:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:47,241 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.2 percent of original size [2021-03-26 00:47:47,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-26 00:47:47,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:47,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 00:47:47,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:47,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-26 00:47:47,327 INFO L142 QuantifierPusher]: treesize reduction 3, result has 92.9 percent of original size [2021-03-26 00:47:47,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:47:47,358 INFO L142 QuantifierPusher]: treesize reduction 4, result has 82.6 percent of original size [2021-03-26 00:47:47,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 00:47:47,376 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:47:47,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621054870] [2021-03-26 00:47:47,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:47,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:47:47,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336082302] [2021-03-26 00:47:47,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:47:47,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:47,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:47:47,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:47:47,379 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 222 [2021-03-26 00:47:47,380 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 97 transitions, 1025 flow. Second operand has 7 states, 7 states have (on average 147.14285714285714) internal successors, (1030), 7 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states 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:47:47,380 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:47,380 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 222 [2021-03-26 00:47:47,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:47,886 INFO L129 PetriNetUnfolder]: 842/1664 cut-off events. [2021-03-26 00:47:47,886 INFO L130 PetriNetUnfolder]: For 10131/10980 co-relation queries the response was YES. [2021-03-26 00:47:47,898 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8131 conditions, 1664 events. 842/1664 cut-off events. For 10131/10980 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 12364 event pairs, 169 based on Foata normal form. 65/1593 useless extension candidates. Maximal degree in co-relation 8093. Up to 1030 conditions per place. [2021-03-26 00:47:47,908 INFO L132 encePairwiseOnDemand]: 213/222 looper letters, 61 selfloop transitions, 16 changer transitions 0/105 dead transitions. [2021-03-26 00:47:47,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 105 transitions, 1261 flow [2021-03-26 00:47:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:47:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:47:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1053 transitions. [2021-03-26 00:47:47,911 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6776061776061776 [2021-03-26 00:47:47,911 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1053 transitions. [2021-03-26 00:47:47,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1053 transitions. [2021-03-26 00:47:47,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:47,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1053 transitions. [2021-03-26 00:47:47,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.42857142857142) internal successors, (1053), 7 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states 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:47:47,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:47:47,917 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 222.0) internal successors, (1776), 8 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states 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:47:47,917 INFO L185 Difference]: Start difference. First operand has 80 places, 97 transitions, 1025 flow. Second operand 7 states and 1053 transitions. [2021-03-26 00:47:47,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 105 transitions, 1261 flow [2021-03-26 00:47:47,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 105 transitions, 1248 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 00:47:47,944 INFO L241 Difference]: Finished difference. Result has 85 places, 97 transitions, 1044 flow [2021-03-26 00:47:47,944 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1044, PETRI_PLACES=85, PETRI_TRANSITIONS=97} [2021-03-26 00:47:47,944 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2021-03-26 00:47:47,944 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:47,944 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 97 transitions, 1044 flow [2021-03-26 00:47:47,945 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 97 transitions, 1044 flow [2021-03-26 00:47:47,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 97 transitions, 1044 flow [2021-03-26 00:47:48,126 INFO L129 PetriNetUnfolder]: 815/1613 cut-off events. [2021-03-26 00:47:48,126 INFO L130 PetriNetUnfolder]: For 8085/8744 co-relation queries the response was YES. [2021-03-26 00:47:48,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 1613 events. 815/1613 cut-off events. For 8085/8744 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 12051 event pairs, 118 based on Foata normal form. 31/1506 useless extension candidates. Maximal degree in co-relation 7420. Up to 1035 conditions per place. [2021-03-26 00:47:48,153 INFO L142 LiptonReduction]: Number of co-enabled transitions 1264 [2021-03-26 00:47:48,327 INFO L154 LiptonReduction]: Checked pairs total: 650 [2021-03-26 00:47:48,327 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:48,327 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 383 [2021-03-26 00:47:48,329 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 97 transitions, 1044 flow [2021-03-26 00:47:48,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 147.14285714285714) internal successors, (1030), 7 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states 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:47:48,329 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:48,329 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:47:48,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:47:48,330 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:48,330 INFO L82 PathProgramCache]: Analyzing trace with hash -813854246, now seen corresponding path program 1 times [2021-03-26 00:47:48,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:48,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639598101] [2021-03-26 00:47:48,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:48,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:48,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:48,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:48,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:48,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:48,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:48,384 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:47:48,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639598101] [2021-03-26 00:47:48,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:48,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:47:48,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145655492] [2021-03-26 00:47:48,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:47:48,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:48,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:47:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:47:48,387 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 222 [2021-03-26 00:47:48,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 97 transitions, 1044 flow. Second operand has 4 states, 4 states have (on average 192.25) internal successors, (769), 4 states have internal predecessors, (769), 0 states have call successors, (0), 0 states 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:47:48,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:48,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 222 [2021-03-26 00:47:48,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:48,765 INFO L129 PetriNetUnfolder]: 1518/3013 cut-off events. [2021-03-26 00:47:48,765 INFO L130 PetriNetUnfolder]: For 18614/20009 co-relation queries the response was YES. [2021-03-26 00:47:48,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13976 conditions, 3013 events. 1518/3013 cut-off events. For 18614/20009 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 25097 event pairs, 241 based on Foata normal form. 171/2918 useless extension candidates. Maximal degree in co-relation 13937. Up to 1938 conditions per place. [2021-03-26 00:47:48,806 INFO L132 encePairwiseOnDemand]: 219/222 looper letters, 21 selfloop transitions, 2 changer transitions 3/107 dead transitions. [2021-03-26 00:47:48,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 107 transitions, 1245 flow [2021-03-26 00:47:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:47:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:47:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 779 transitions. [2021-03-26 00:47:48,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8772522522522522 [2021-03-26 00:47:48,809 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 779 transitions. [2021-03-26 00:47:48,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 779 transitions. [2021-03-26 00:47:48,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:48,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 779 transitions. [2021-03-26 00:47:48,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 0 states 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:47:48,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:47:48,825 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 222.0) internal successors, (1110), 5 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states 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:47:48,825 INFO L185 Difference]: Start difference. First operand has 85 places, 97 transitions, 1044 flow. Second operand 4 states and 779 transitions. [2021-03-26 00:47:48,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 107 transitions, 1245 flow [2021-03-26 00:47:48,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 107 transitions, 1205 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 00:47:48,875 INFO L241 Difference]: Finished difference. Result has 85 places, 98 transitions, 1027 flow [2021-03-26 00:47:48,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1027, PETRI_PLACES=85, PETRI_TRANSITIONS=98} [2021-03-26 00:47:48,875 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2021-03-26 00:47:48,875 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:48,876 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 98 transitions, 1027 flow [2021-03-26 00:47:48,876 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 98 transitions, 1027 flow [2021-03-26 00:47:48,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 98 transitions, 1027 flow [2021-03-26 00:47:49,147 INFO L129 PetriNetUnfolder]: 1390/2748 cut-off events. [2021-03-26 00:47:49,147 INFO L130 PetriNetUnfolder]: For 13867/14978 co-relation queries the response was YES. [2021-03-26 00:47:49,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12705 conditions, 2748 events. 1390/2748 cut-off events. For 13867/14978 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 22536 event pairs, 215 based on Foata normal form. 46/2547 useless extension candidates. Maximal degree in co-relation 12667. Up to 1813 conditions per place. [2021-03-26 00:47:49,195 INFO L142 LiptonReduction]: Number of co-enabled transitions 1282 [2021-03-26 00:47:49,207 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:47:49,208 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:49,208 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 333 [2021-03-26 00:47:49,208 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 1027 flow [2021-03-26 00:47:49,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 192.25) internal successors, (769), 4 states have internal predecessors, (769), 0 states have call successors, (0), 0 states 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:47:49,209 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:49,209 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:47:49,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:47:49,209 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:49,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash -249786105, now seen corresponding path program 1 times [2021-03-26 00:47:49,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:49,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251772982] [2021-03-26 00:47:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:49,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:49,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:49,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:49,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:49,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:49,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:49,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:49,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:49,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:49,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:49,316 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:47:49,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251772982] [2021-03-26 00:47:49,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:49,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:47:49,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387266484] [2021-03-26 00:47:49,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:47:49,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:49,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:47:49,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:47:49,318 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 222 [2021-03-26 00:47:49,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 1027 flow. Second operand has 6 states, 6 states have (on average 193.83333333333334) internal successors, (1163), 6 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states 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:47:49,319 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:49,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 222 [2021-03-26 00:47:49,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:49,710 INFO L129 PetriNetUnfolder]: 1028/2212 cut-off events. [2021-03-26 00:47:49,710 INFO L130 PetriNetUnfolder]: For 13354/19086 co-relation queries the response was YES. [2021-03-26 00:47:49,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11476 conditions, 2212 events. 1028/2212 cut-off events. For 13354/19086 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 18634 event pairs, 27 based on Foata normal form. 998/2996 useless extension candidates. Maximal degree in co-relation 11436. Up to 1513 conditions per place. [2021-03-26 00:47:49,732 INFO L132 encePairwiseOnDemand]: 215/222 looper letters, 9 selfloop transitions, 25 changer transitions 7/96 dead transitions. [2021-03-26 00:47:49,733 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 1037 flow [2021-03-26 00:47:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:47:49,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:47:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1775 transitions. [2021-03-26 00:47:49,737 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8883883883883884 [2021-03-26 00:47:49,737 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1775 transitions. [2021-03-26 00:47:49,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1775 transitions. [2021-03-26 00:47:49,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:49,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1775 transitions. [2021-03-26 00:47:49,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 197.22222222222223) internal successors, (1775), 9 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states 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:47:49,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states 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:47:49,748 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 222.0) internal successors, (2220), 10 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states 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:47:49,748 INFO L185 Difference]: Start difference. First operand has 85 places, 98 transitions, 1027 flow. Second operand 9 states and 1775 transitions. [2021-03-26 00:47:49,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 1037 flow [2021-03-26 00:47:49,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 96 transitions, 985 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 00:47:49,781 INFO L241 Difference]: Finished difference. Result has 92 places, 89 transitions, 930 flow [2021-03-26 00:47:49,781 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=930, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2021-03-26 00:47:49,781 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 36 predicate places. [2021-03-26 00:47:49,781 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:49,782 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 89 transitions, 930 flow [2021-03-26 00:47:49,782 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 89 transitions, 930 flow [2021-03-26 00:47:49,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 89 transitions, 930 flow [2021-03-26 00:47:49,942 INFO L129 PetriNetUnfolder]: 821/1968 cut-off events. [2021-03-26 00:47:49,942 INFO L130 PetriNetUnfolder]: For 12756/14620 co-relation queries the response was YES. [2021-03-26 00:47:49,953 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10730 conditions, 1968 events. 821/1968 cut-off events. For 12756/14620 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 17784 event pairs, 26 based on Foata normal form. 38/1825 useless extension candidates. Maximal degree in co-relation 10691. Up to 1260 conditions per place. [2021-03-26 00:47:49,974 INFO L142 LiptonReduction]: Number of co-enabled transitions 1336 [2021-03-26 00:47:49,983 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:47:49,983 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:47:49,983 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 202 [2021-03-26 00:47:49,984 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 930 flow [2021-03-26 00:47:49,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 193.83333333333334) internal successors, (1163), 6 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states 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:47:49,984 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:49,984 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:47:49,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:47:49,984 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:49,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:49,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1243495128, now seen corresponding path program 1 times [2021-03-26 00:47:49,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:49,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125083556] [2021-03-26 00:47:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:47:50,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:50,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:50,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:50,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:50,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:50,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:50,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:50,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:50,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:50,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:47:50,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:47:50,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:47:50,075 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:47:50,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125083556] [2021-03-26 00:47:50,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:47:50,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:47:50,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510498992] [2021-03-26 00:47:50,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:47:50,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:47:50,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:47:50,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:47:50,079 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 222 [2021-03-26 00:47:50,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 930 flow. Second operand has 7 states, 7 states have (on average 193.85714285714286) internal successors, (1357), 7 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states 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:47:50,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:47:50,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 222 [2021-03-26 00:47:50,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:47:50,407 INFO L129 PetriNetUnfolder]: 719/1775 cut-off events. [2021-03-26 00:47:50,407 INFO L130 PetriNetUnfolder]: For 14902/22333 co-relation queries the response was YES. [2021-03-26 00:47:50,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10996 conditions, 1775 events. 719/1775 cut-off events. For 14902/22333 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 15814 event pairs, 0 based on Foata normal form. 877/2456 useless extension candidates. Maximal degree in co-relation 10955. Up to 1203 conditions per place. [2021-03-26 00:47:50,421 INFO L132 encePairwiseOnDemand]: 215/222 looper letters, 4 selfloop transitions, 30 changer transitions 14/88 dead transitions. [2021-03-26 00:47:50,421 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 88 transitions, 998 flow [2021-03-26 00:47:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 00:47:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 00:47:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2161 transitions. [2021-03-26 00:47:50,427 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8849303849303849 [2021-03-26 00:47:50,427 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2161 transitions. [2021-03-26 00:47:50,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2161 transitions. [2021-03-26 00:47:50,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:47:50,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2161 transitions. [2021-03-26 00:47:50,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 196.45454545454547) internal successors, (2161), 11 states have internal predecessors, (2161), 0 states have call successors, (0), 0 states 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:47:50,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 222.0) internal successors, (2664), 12 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states 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:47:50,437 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 222.0) internal successors, (2664), 12 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states 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:47:50,437 INFO L185 Difference]: Start difference. First operand has 92 places, 89 transitions, 930 flow. Second operand 11 states and 2161 transitions. [2021-03-26 00:47:50,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 88 transitions, 998 flow [2021-03-26 00:47:50,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 88 transitions, 868 flow, removed 39 selfloop flow, removed 7 redundant places. [2021-03-26 00:47:50,568 INFO L241 Difference]: Finished difference. Result has 98 places, 74 transitions, 731 flow [2021-03-26 00:47:50,568 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=222, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=731, PETRI_PLACES=98, PETRI_TRANSITIONS=74} [2021-03-26 00:47:50,569 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 42 predicate places. [2021-03-26 00:47:50,569 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:47:50,569 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 74 transitions, 731 flow [2021-03-26 00:47:50,569 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 74 transitions, 731 flow [2021-03-26 00:47:50,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 97 places, 74 transitions, 731 flow [2021-03-26 00:47:50,686 INFO L129 PetriNetUnfolder]: 573/1450 cut-off events. [2021-03-26 00:47:50,686 INFO L130 PetriNetUnfolder]: For 5708/6414 co-relation queries the response was YES. [2021-03-26 00:47:50,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6554 conditions, 1450 events. 573/1450 cut-off events. For 5708/6414 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 13028 event pairs, 1 based on Foata normal form. 27/1303 useless extension candidates. Maximal degree in co-relation 6514. Up to 395 conditions per place. [2021-03-26 00:47:50,700 INFO L142 LiptonReduction]: Number of co-enabled transitions 986 [2021-03-26 00:47:51,733 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 234 DAG size of output: 193 [2021-03-26 00:47:52,040 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2021-03-26 00:47:53,513 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 318 DAG size of output: 273 [2021-03-26 00:47:54,181 WARN L205 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-26 00:47:54,191 INFO L154 LiptonReduction]: Checked pairs total: 30 [2021-03-26 00:47:54,191 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:47:54,191 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3622 [2021-03-26 00:47:54,192 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 73 transitions, 729 flow [2021-03-26 00:47:54,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 193.85714285714286) internal successors, (1357), 7 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states 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:47:54,192 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:47:54,192 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:47:54,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:47:54,193 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:47:54,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:47:54,193 INFO L82 PathProgramCache]: Analyzing trace with hash -653174083, now seen corresponding path program 1 times [2021-03-26 00:47:54,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:47:54,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718698349] [2021-03-26 00:47:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:47:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:47:54,233 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:47:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:47:54,285 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:47:54,328 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:47:54,330 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:47:54,330 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:47:54,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:47:54 BasicIcfg [2021-03-26 00:47:54,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:47:54,448 INFO L168 Benchmark]: Toolchain (without parser) took 43648.15 ms. Allocated memory was 255.9 MB in the beginning and 962.6 MB in the end (delta: 706.7 MB). Free memory was 233.2 MB in the beginning and 842.4 MB in the end (delta: -609.2 MB). Peak memory consumption was 97.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:47:54,448 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:47:54,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.86 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 232.6 MB in the beginning and 306.8 MB in the end (delta: -74.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:47:54,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.55 ms. Allocated memory is still 348.1 MB. Free memory was 306.8 MB in the beginning and 304.7 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:47:54,449 INFO L168 Benchmark]: Boogie Preprocessor took 73.50 ms. Allocated memory is still 348.1 MB. Free memory was 304.7 MB in the beginning and 301.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:47:54,449 INFO L168 Benchmark]: RCFGBuilder took 2035.94 ms. Allocated memory is still 348.1 MB. Free memory was 301.9 MB in the beginning and 159.9 MB in the end (delta: 142.0 MB). Peak memory consumption was 144.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:47:54,449 INFO L168 Benchmark]: TraceAbstraction took 40977.37 ms. Allocated memory was 348.1 MB in the beginning and 962.6 MB in the end (delta: 614.5 MB). Free memory was 159.9 MB in the beginning and 842.4 MB in the end (delta: -682.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:47:54,450 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.13 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 510.86 ms. Allocated memory was 255.9 MB in the beginning and 348.1 MB in the end (delta: 92.3 MB). Free memory was 232.6 MB in the beginning and 306.8 MB in the end (delta: -74.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 45.55 ms. Allocated memory is still 348.1 MB. Free memory was 306.8 MB in the beginning and 304.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 73.50 ms. Allocated memory is still 348.1 MB. Free memory was 304.7 MB in the beginning and 301.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2035.94 ms. Allocated memory is still 348.1 MB. Free memory was 301.9 MB in the beginning and 159.9 MB in the end (delta: 142.0 MB). Peak memory consumption was 144.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 40977.37 ms. Allocated memory was 348.1 MB in the beginning and 962.6 MB in the end (delta: 614.5 MB). Free memory was 159.9 MB in the beginning and 842.4 MB in the end (delta: -682.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8277.9ms, 123 PlacesBefore, 56 PlacesAfterwards, 111 TransitionsBefore, 44 TransitionsAfterwards, 1358 CoEnabledTransitionPairs, 4 FixpointIterations, 41 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 70 TotalNumberOfCompositions, 1686 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1033, positive: 990, positive conditional: 990, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 892, positive: 861, positive conditional: 0, positive unconditional: 861, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 892, positive: 861, positive conditional: 0, positive unconditional: 861, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 892, positive: 845, positive conditional: 0, positive unconditional: 845, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2313, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 405, negative conditional: 0, negative unconditional: 405, unknown: 1849, unknown conditional: 0, unknown unconditional: 1849] ], Cache Queries: [ total: 1033, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 892, unknown conditional: 892, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 25, Positive conditional cache size: 25, Positive unconditional cache size: 0, Negative cache size: 10, Negative conditional cache size: 10, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2959.8ms, 58 PlacesBefore, 40 PlacesAfterwards, 41 TransitionsBefore, 26 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 4 FixpointIterations, 14 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 897 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 231, positive: 166, positive conditional: 166, positive unconditional: 0, negative: 65, negative conditional: 65, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 57, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 13, negative conditional: 1, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 57, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 12, negative conditional: 1, negative unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1563, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 156, negative conditional: 5, negative unconditional: 152, unknown: 1387, unknown conditional: 0, unknown unconditional: 1387] ], Cache Queries: [ total: 231, positive: 122, positive conditional: 122, positive unconditional: 0, negative: 52, negative conditional: 52, negative unconditional: 0, unknown: 57, unknown conditional: 57, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 52, Positive conditional cache size: 52, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3435.5ms, 41 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 22 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 4 FixpointIterations, 4 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 788 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, positive: 148, positive conditional: 148, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 93, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, positive: 145, positive conditional: 145, positive unconditional: 0, negative: 56, negative conditional: 56, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 55, Positive conditional cache size: 55, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4ms, 36 PlacesBefore, 36 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 180 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 55, positive: 41, positive conditional: 41, 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: 14, positive: 14, positive conditional: 8, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 8, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 55, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 69, Positive conditional cache size: 69, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3316.9ms, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 456 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 114, positive: 87, positive conditional: 87, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 10, positive unconditional: 0, 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: 12, positive: 10, positive conditional: 10, positive unconditional: 0, 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: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 204, positive: 147, positive conditional: 147, positive unconditional: 0, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 73, Positive conditional cache size: 73, 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: 6305.8ms, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 484 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 135, positive: 108, positive conditional: 108, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, 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: 8, positive: 8, positive conditional: 8, 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: 8, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 81, Positive conditional cache size: 81, 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: 3079.9ms, 52 PlacesBefore, 52 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1089 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 16, positive unconditional: 2, 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: 18, positive: 18, positive conditional: 16, positive unconditional: 2, 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: 18, positive: 18, positive conditional: 0, positive unconditional: 18, 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: 93, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 98, Positive conditional cache size: 98, 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: 103.7ms, 59 PlacesBefore, 59 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 626 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 276 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 98, Positive conditional cache size: 98, 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: 87.1ms, 67 PlacesBefore, 67 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 758 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 235 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, 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: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 98, Positive conditional cache size: 98, 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: 224.8ms, 70 PlacesBefore, 70 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 440 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 8, positive conditional: 8, 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: 4, positive: 2, positive conditional: 2, 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: 4, positive: 2, positive conditional: 2, 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: 4, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 100, Positive conditional cache size: 100, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 268.3ms, 74 PlacesBefore, 74 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 1144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 549 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 180, positive: 171, positive conditional: 171, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 34, positive conditional: 30, positive unconditional: 4, 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: 36, positive: 34, positive conditional: 30, positive unconditional: 4, 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: 36, positive: 34, positive conditional: 0, positive unconditional: 34, 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: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, positive: 137, positive conditional: 137, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 36, unknown conditional: 36, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 134, Positive conditional cache size: 134, Positive unconditional cache size: 0, Negative cache size: 26, Negative conditional cache size: 26, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 396.4ms, 80 PlacesBefore, 80 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 1272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 660 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 250, positive: 240, positive conditional: 240, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 26, positive conditional: 26, 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: 28, positive: 26, positive conditional: 26, 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: 28, positive: 26, positive conditional: 0, positive unconditional: 26, 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: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 250, positive: 214, positive conditional: 214, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 160, Positive conditional cache size: 160, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 382.1ms, 85 PlacesBefore, 85 PlacesAfterwards, 97 TransitionsBefore, 97 TransitionsAfterwards, 1264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 650 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 210, positive: 200, positive conditional: 200, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 8, 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: 10, positive: 8, positive conditional: 8, 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: 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: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, positive: 192, positive conditional: 192, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 168, Positive conditional cache size: 168, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 331.8ms, 85 PlacesBefore, 85 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 1282 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 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): 198, Positive cache size: 168, Positive conditional cache size: 168, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 201.2ms, 92 PlacesBefore, 92 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 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): 198, Positive cache size: 168, Positive conditional cache size: 168, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3622.1ms, 98 PlacesBefore, 96 PlacesAfterwards, 74 TransitionsBefore, 73 TransitionsAfterwards, 986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 30, 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: 28, positive: 28, positive conditional: 28, 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: 28, positive: 28, positive conditional: 28, 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: 28, positive: 28, positive conditional: 0, positive unconditional: 28, 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: 30, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 126, Positive conditional cache size: 126, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L863] 0 pthread_t t2437; [L864] FCALL, FORK 0 pthread_create(&t2437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L772] EXPR 1 \read(y) [L772] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L772] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L773] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L773] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L773] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L774] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L774] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L775] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L775] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L776] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L776] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L777] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L777] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L777] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L778] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L778] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L779] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L780] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L781] EXPR 1 \read(y) [L781] 1 __unbuffered_p0_EAX = y [L782] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L782] EXPR 1 \read(y) [L782] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L782] 1 y = y$flush_delayed ? y$mem_tmp : y [L783] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L865] 0 pthread_t t2438; [L866] FCALL, FORK 0 pthread_create(&t2438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=0, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L867] 0 pthread_t t2439; [L868] FCALL, FORK 0 pthread_create(&t2439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L869] 0 pthread_t t2440; [L810] 3 __unbuffered_p2_EAX = x [L813] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L814] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L815] 3 y$flush_delayed = weak$$choice2 [L816] EXPR 3 \read(y) [L816] 3 y$mem_tmp = y [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] EXPR 3 \read(y) [L817] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L817] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L818] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L819] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L819] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L820] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L820] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L821] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L822] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L823] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 \read(y) [L824] 3 __unbuffered_p2_EBX = y [L825] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L825] 3 y = y$flush_delayed ? y$mem_tmp : y [L826] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=54, weak$$choice1=0, weak$$choice2=255, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L870] FCALL, FORK 0 pthread_create(&t2440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=54, weak$$choice1=0, weak$$choice2=255, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=54, weak$$choice1=0, weak$$choice2=255, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 \read(y) [L841] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L841] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L841] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L842] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L843] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L843] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L844] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L844] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L845] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L845] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L791] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 1 return 0; [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L850] 4 return 0; [L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 \read(y) [L876] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L876] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L876] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L877] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L878] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L878] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L879] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L879] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L880] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice1=255, weak$$choice2=255, x=1, y={8:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 40718.5ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 4571.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8430.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 71 SDtfs, 54 SDslu, 33 SDs, 0 SdLazy, 773 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 950.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1487.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1044occurred in iteration=12, InterpolantAutomatonStates: 85, 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: 61.0ms SsaConstructionTime, 700.6ms SatisfiabilityAnalysisTime, 1894.6ms InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 3425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...