/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:28:58,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:28:58,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:28:58,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:28:58,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:28:58,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:28:58,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:28:58,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:28:58,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:28:58,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:28:58,394 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:28:58,395 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:28:58,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:28:58,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:28:58,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:28:58,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:28:58,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:28:58,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:28:58,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:28:58,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:28:58,404 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:28:58,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:28:58,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:28:58,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:28:58,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:28:58,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:28:58,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:28:58,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:28:58,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:28:58,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:28:58,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:28:58,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:28:58,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:28:58,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:28:58,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:28:58,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:28:58,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:28:58,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:28:58,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:28:58,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:28:58,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:28:58,420 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:28:58,457 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:28:58,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:28:58,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:28:58,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:28:58,459 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:28:58,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:28:58,459 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:28:58,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:28:58,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:28:58,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:28:58,459 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:28:58,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:28:58,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:28:58,460 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:28:58,460 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:28:58,460 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:28:58,460 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:28:58,460 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:28:58,461 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:28:58,461 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:28:58,461 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:28:58,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:28:58,461 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:28:58,461 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:28:58,461 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:28:58,462 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:28:58,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:28:58,462 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:28:58,462 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:28:58,462 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:28:58,462 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 10:28:58,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:28:58,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:28:58,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:28:58,795 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:28:58,795 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:28:58,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i [2021-03-26 10:28:58,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e54bb5a/0df9dd89108e486287f6bbb098847fe6/FLAG452703799 [2021-03-26 10:28:59,434 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:28:59,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i [2021-03-26 10:28:59,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e54bb5a/0df9dd89108e486287f6bbb098847fe6/FLAG452703799 [2021-03-26 10:28:59,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e54bb5a/0df9dd89108e486287f6bbb098847fe6 [2021-03-26 10:28:59,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:28:59,876 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:28:59,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:28:59,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:28:59,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:28:59,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:28:59" (1/1) ... [2021-03-26 10:28:59,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7ea82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:28:59, skipping insertion in model container [2021-03-26 10:28:59,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:28:59" (1/1) ... [2021-03-26 10:28:59,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:28:59,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:29:00,076 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i[994,1007] [2021-03-26 10:29:00,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:29:00,285 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:29:00,296 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i[994,1007] [2021-03-26 10:29:00,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:29:00,427 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:29:00,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00 WrapperNode [2021-03-26 10:29:00,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:29:00,430 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:29:00,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:29:00,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:29:00,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (1/1) ... [2021-03-26 10:29:00,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (1/1) ... [2021-03-26 10:29:00,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:29:00,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:29:00,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:29:00,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:29:00,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (1/1) ... [2021-03-26 10:29:00,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (1/1) ... [2021-03-26 10:29:00,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (1/1) ... [2021-03-26 10:29:00,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (1/1) ... [2021-03-26 10:29:00,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (1/1) ... [2021-03-26 10:29:00,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (1/1) ... [2021-03-26 10:29:00,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (1/1) ... [2021-03-26 10:29:00,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:29:00,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:29:00,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:29:00,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:29:00,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (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 10:29:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:29:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:29:00,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:29:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:29:00,636 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:29:00,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:29:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:29:00,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:29:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:29:00,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:29:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:29:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:29:00,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:29:00,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:29:00,639 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 10:29:02,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:29:02,394 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:29:02,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:29:02 BoogieIcfgContainer [2021-03-26 10:29:02,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:29:02,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:29:02,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:29:02,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:29:02,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:28:59" (1/3) ... [2021-03-26 10:29:02,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bf2636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:29:02, skipping insertion in model container [2021-03-26 10:29:02,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:29:00" (2/3) ... [2021-03-26 10:29:02,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20bf2636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:29:02, skipping insertion in model container [2021-03-26 10:29:02,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:29:02" (3/3) ... [2021-03-26 10:29:02,403 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_power.opt.i [2021-03-26 10:29:02,409 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:29:02,413 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:29:02,414 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:29:02,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,454 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,457 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,469 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,469 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,470 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,470 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,470 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,471 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,474 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,475 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,484 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,485 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,489 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,490 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:29:02,497 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:29:02,513 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:29:02,530 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:29:02,530 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:29:02,530 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:29:02,530 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:29:02,530 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:29:02,530 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:29:02,531 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:29:02,531 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:29:02,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:29:02,572 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:29:02,572 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:29:02,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-26 10:29:02,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:29:02,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 10:29:02,580 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:02,591 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:29:02,593 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:29:02,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 10:29:02,611 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:29:02,611 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:29:02,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-26 10:29:02,614 INFO L142 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-26 10:29:03,623 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:29:04,061 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:29:04,191 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:29:05,589 INFO L154 LiptonReduction]: Checked pairs total: 2292 [2021-03-26 10:29:05,590 INFO L156 LiptonReduction]: Total number of compositions: 63 [2021-03-26 10:29:05,592 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3013 [2021-03-26 10:29:05,604 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-26 10:29:05,604 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:29:05,605 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:05,606 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:05,607 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1578923408, now seen corresponding path program 1 times [2021-03-26 10:29:05,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:05,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200449772] [2021-03-26 10:29:05,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:05,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:05,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:29:05,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:05,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:05,808 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 10:29:05,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200449772] [2021-03-26 10:29:05,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:05,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:29:05,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873666257] [2021-03-26 10:29:05,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:29:05,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:05,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:29:05,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:29:05,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 160 [2021-03-26 10:29:05,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:05,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:05,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 160 [2021-03-26 10:29:05,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:05,913 INFO L129 PetriNetUnfolder]: 29/139 cut-off events. [2021-03-26 10:29:05,913 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:29:05,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 139 events. 29/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 579 event pairs, 15 based on Foata normal form. 9/131 useless extension candidates. Maximal degree in co-relation 185. Up to 41 conditions per place. [2021-03-26 10:29:05,918 INFO L132 encePairwiseOnDemand]: 156/160 looper letters, 7 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2021-03-26 10:29:05,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 101 flow [2021-03-26 10:29:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:29:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:29:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2021-03-26 10:29:05,937 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9125 [2021-03-26 10:29:05,938 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2021-03-26 10:29:05,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2021-03-26 10:29:05,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:05,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2021-03-26 10:29:05,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:05,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:05,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:05,957 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 438 transitions. [2021-03-26 10:29:05,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 101 flow [2021-03-26 10:29:05,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:29:05,961 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 78 flow [2021-03-26 10:29:05,962 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-26 10:29:05,963 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-26 10:29:05,963 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:05,963 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-26 10:29:05,964 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-26 10:29:05,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-26 10:29:05,970 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 10:29:05,971 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:29:05,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:29:05,971 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-26 10:29:07,051 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 10:29:07,177 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 10:29:07,297 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 10:29:07,420 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-03-26 10:29:07,750 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 10:29:07,888 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:29:08,221 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 10:29:08,345 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 10:29:08,351 INFO L154 LiptonReduction]: Checked pairs total: 1420 [2021-03-26 10:29:08,351 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:29:08,351 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2388 [2021-03-26 10:29:08,352 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-26 10:29:08,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:08,353 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 10:29:08,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:29:08,353 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash 345032814, now seen corresponding path program 1 times [2021-03-26 10:29:08,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:08,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526366881] [2021-03-26 10:29:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:08,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:08,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:29:08,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:08,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:08,470 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:29:08,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:29:08,474 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 10:29:08,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526366881] [2021-03-26 10:29:08,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:08,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:29:08,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688888353] [2021-03-26 10:29:08,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:29:08,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:08,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:29:08,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:29:08,477 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 172 [2021-03-26 10:29:08,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:08,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 172 [2021-03-26 10:29:08,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:08,500 INFO L129 PetriNetUnfolder]: 1/26 cut-off events. [2021-03-26 10:29:08,500 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:29:08,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 34. Up to 3 conditions per place. [2021-03-26 10:29:08,500 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 1 selfloop transitions, 2 changer transitions 5/25 dead transitions. [2021-03-26 10:29:08,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 72 flow [2021-03-26 10:29:08,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:29:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:29:08,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2021-03-26 10:29:08,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8569767441860465 [2021-03-26 10:29:08,504 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2021-03-26 10:29:08,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2021-03-26 10:29:08,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:08,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2021-03-26 10:29:08,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,508 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,509 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 737 transitions. [2021-03-26 10:29:08,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 72 flow [2021-03-26 10:29:08,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 25 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:29:08,510 INFO L241 Difference]: Finished difference. Result has 35 places, 20 transitions, 54 flow [2021-03-26 10:29:08,510 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2021-03-26 10:29:08,510 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -11 predicate places. [2021-03-26 10:29:08,510 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:08,511 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 20 transitions, 54 flow [2021-03-26 10:29:08,511 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 20 transitions, 54 flow [2021-03-26 10:29:08,511 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2021-03-26 10:29:08,514 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-03-26 10:29:08,514 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:29:08,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:29:08,514 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-26 10:29:08,533 INFO L154 LiptonReduction]: Checked pairs total: 215 [2021-03-26 10:29:08,534 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:29:08,534 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-26 10:29:08,536 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-03-26 10:29:08,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,537 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:08,537 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:08,537 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:29:08,537 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:08,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1526229437, now seen corresponding path program 1 times [2021-03-26 10:29:08,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:08,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462809528] [2021-03-26 10:29:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:08,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:08,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:08,651 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 10:29:08,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462809528] [2021-03-26 10:29:08,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:08,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:29:08,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991390751] [2021-03-26 10:29:08,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:29:08,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:08,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:29:08,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:29:08,653 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 172 [2021-03-26 10:29:08,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:08,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 172 [2021-03-26 10:29:08,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:08,668 INFO L129 PetriNetUnfolder]: 16/66 cut-off events. [2021-03-26 10:29:08,669 INFO L130 PetriNetUnfolder]: For 11/22 co-relation queries the response was YES. [2021-03-26 10:29:08,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 66 events. 16/66 cut-off events. For 11/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 211 event pairs, 7 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 115. Up to 32 conditions per place. [2021-03-26 10:29:08,669 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 7 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-26 10:29:08,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 24 transitions, 85 flow [2021-03-26 10:29:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:29:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:29:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2021-03-26 10:29:08,671 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2021-03-26 10:29:08,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2021-03-26 10:29:08,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2021-03-26 10:29:08,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:08,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2021-03-26 10:29:08,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,674 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 452 transitions. [2021-03-26 10:29:08,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 24 transitions, 85 flow [2021-03-26 10:29:08,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 24 transitions, 79 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:29:08,675 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 69 flow [2021-03-26 10:29:08,676 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-03-26 10:29:08,676 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -15 predicate places. [2021-03-26 10:29:08,676 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:08,676 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 69 flow [2021-03-26 10:29:08,676 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 69 flow [2021-03-26 10:29:08,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 69 flow [2021-03-26 10:29:08,680 INFO L129 PetriNetUnfolder]: 3/30 cut-off events. [2021-03-26 10:29:08,680 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:29:08,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 10:29:08,681 INFO L142 LiptonReduction]: Number of co-enabled transitions 210 [2021-03-26 10:29:08,717 INFO L154 LiptonReduction]: Checked pairs total: 188 [2021-03-26 10:29:08,717 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:29:08,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-26 10:29:08,718 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 69 flow [2021-03-26 10:29:08,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,719 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:08,719 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:08,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:29:08,719 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:08,720 INFO L82 PathProgramCache]: Analyzing trace with hash -83069138, now seen corresponding path program 1 times [2021-03-26 10:29:08,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:08,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741424527] [2021-03-26 10:29:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:08,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:08,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:08,764 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:29:08,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:29:08,773 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 10:29:08,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741424527] [2021-03-26 10:29:08,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:08,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:29:08,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214254128] [2021-03-26 10:29:08,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:29:08,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:29:08,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:29:08,775 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 172 [2021-03-26 10:29:08,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:08,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 172 [2021-03-26 10:29:08,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:08,802 INFO L129 PetriNetUnfolder]: 19/86 cut-off events. [2021-03-26 10:29:08,802 INFO L130 PetriNetUnfolder]: For 50/88 co-relation queries the response was YES. [2021-03-26 10:29:08,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 86 events. 19/86 cut-off events. For 50/88 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 341 event pairs, 7 based on Foata normal form. 11/93 useless extension candidates. Maximal degree in co-relation 173. Up to 24 conditions per place. [2021-03-26 10:29:08,803 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 9 selfloop transitions, 6 changer transitions 1/29 dead transitions. [2021-03-26 10:29:08,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 127 flow [2021-03-26 10:29:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:29:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:29:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2021-03-26 10:29:08,806 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8168604651162791 [2021-03-26 10:29:08,806 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2021-03-26 10:29:08,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2021-03-26 10:29:08,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:08,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2021-03-26 10:29:08,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,810 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 69 flow. Second operand 4 states and 562 transitions. [2021-03-26 10:29:08,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 127 flow [2021-03-26 10:29:08,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:29:08,812 INFO L241 Difference]: Finished difference. Result has 36 places, 26 transitions, 116 flow [2021-03-26 10:29:08,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2021-03-26 10:29:08,812 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -10 predicate places. [2021-03-26 10:29:08,812 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:08,812 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 116 flow [2021-03-26 10:29:08,813 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 116 flow [2021-03-26 10:29:08,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 116 flow [2021-03-26 10:29:08,820 INFO L129 PetriNetUnfolder]: 8/59 cut-off events. [2021-03-26 10:29:08,821 INFO L130 PetriNetUnfolder]: For 56/71 co-relation queries the response was YES. [2021-03-26 10:29:08,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 59 events. 8/59 cut-off events. For 56/71 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 201 event pairs, 1 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 125. Up to 18 conditions per place. [2021-03-26 10:29:08,822 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-26 10:29:08,867 INFO L154 LiptonReduction]: Checked pairs total: 190 [2021-03-26 10:29:08,867 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:29:08,867 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 55 [2021-03-26 10:29:08,868 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 116 flow [2021-03-26 10:29:08,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,869 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:08,869 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:08,869 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:29:08,869 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:08,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2107435462, now seen corresponding path program 1 times [2021-03-26 10:29:08,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:08,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044253349] [2021-03-26 10:29:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:08,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:08,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:08,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:08,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:08,951 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:29:08,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:29:08,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 10:29:08,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044253349] [2021-03-26 10:29:08,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:08,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:29:08,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361307941] [2021-03-26 10:29:08,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:29:08,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:08,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:29:08,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:29:08,965 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 172 [2021-03-26 10:29:08,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:08,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:08,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 172 [2021-03-26 10:29:08,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:09,013 INFO L129 PetriNetUnfolder]: 15/90 cut-off events. [2021-03-26 10:29:09,013 INFO L130 PetriNetUnfolder]: For 104/143 co-relation queries the response was YES. [2021-03-26 10:29:09,016 INFO L84 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 90 events. 15/90 cut-off events. For 104/143 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 403 event pairs, 5 based on Foata normal form. 8/95 useless extension candidates. Maximal degree in co-relation 226. Up to 27 conditions per place. [2021-03-26 10:29:09,017 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 7 selfloop transitions, 7 changer transitions 6/33 dead transitions. [2021-03-26 10:29:09,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 197 flow [2021-03-26 10:29:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:29:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:29:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2021-03-26 10:29:09,019 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8162790697674419 [2021-03-26 10:29:09,019 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2021-03-26 10:29:09,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2021-03-26 10:29:09,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:09,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2021-03-26 10:29:09,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,024 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,025 INFO L185 Difference]: Start difference. First operand has 36 places, 26 transitions, 116 flow. Second operand 5 states and 702 transitions. [2021-03-26 10:29:09,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 197 flow [2021-03-26 10:29:09,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 189 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:29:09,028 INFO L241 Difference]: Finished difference. Result has 39 places, 25 transitions, 121 flow [2021-03-26 10:29:09,028 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2021-03-26 10:29:09,028 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -7 predicate places. [2021-03-26 10:29:09,028 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:09,028 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 25 transitions, 121 flow [2021-03-26 10:29:09,029 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 25 transitions, 121 flow [2021-03-26 10:29:09,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 25 transitions, 121 flow [2021-03-26 10:29:09,035 INFO L129 PetriNetUnfolder]: 3/45 cut-off events. [2021-03-26 10:29:09,035 INFO L130 PetriNetUnfolder]: For 38/41 co-relation queries the response was YES. [2021-03-26 10:29:09,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 45 events. 3/45 cut-off events. For 38/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 101. Up to 12 conditions per place. [2021-03-26 10:29:09,036 INFO L142 LiptonReduction]: Number of co-enabled transitions 222 [2021-03-26 10:29:09,045 INFO L154 LiptonReduction]: Checked pairs total: 193 [2021-03-26 10:29:09,045 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:29:09,045 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-26 10:29:09,048 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 121 flow [2021-03-26 10:29:09,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,050 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:09,050 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:09,050 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:29:09,050 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:09,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:09,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1278673696, now seen corresponding path program 1 times [2021-03-26 10:29:09,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:09,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836189783] [2021-03-26 10:29:09,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:09,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:29:09,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:09,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:09,145 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 10:29:09,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836189783] [2021-03-26 10:29:09,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:09,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:29:09,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986354368] [2021-03-26 10:29:09,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:29:09,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:09,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:29:09,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:29:09,150 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 172 [2021-03-26 10:29:09,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states 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 10:29:09,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:09,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 172 [2021-03-26 10:29:09,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:09,186 INFO L129 PetriNetUnfolder]: 7/77 cut-off events. [2021-03-26 10:29:09,187 INFO L130 PetriNetUnfolder]: For 121/123 co-relation queries the response was YES. [2021-03-26 10:29:09,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 77 events. 7/77 cut-off events. For 121/123 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 1 based on Foata normal form. 5/78 useless extension candidates. Maximal degree in co-relation 192. Up to 17 conditions per place. [2021-03-26 10:29:09,187 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 6 selfloop transitions, 4 changer transitions 4/29 dead transitions. [2021-03-26 10:29:09,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 175 flow [2021-03-26 10:29:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:29:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:29:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2021-03-26 10:29:09,191 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8348837209302326 [2021-03-26 10:29:09,191 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2021-03-26 10:29:09,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2021-03-26 10:29:09,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:09,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2021-03-26 10:29:09,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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 10:29:09,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,196 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,196 INFO L185 Difference]: Start difference. First operand has 39 places, 25 transitions, 121 flow. Second operand 5 states and 718 transitions. [2021-03-26 10:29:09,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 175 flow [2021-03-26 10:29:09,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 153 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-26 10:29:09,201 INFO L241 Difference]: Finished difference. Result has 43 places, 24 transitions, 121 flow [2021-03-26 10:29:09,202 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2021-03-26 10:29:09,202 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-26 10:29:09,202 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:09,202 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 24 transitions, 121 flow [2021-03-26 10:29:09,202 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 24 transitions, 121 flow [2021-03-26 10:29:09,203 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 24 transitions, 121 flow [2021-03-26 10:29:09,211 INFO L129 PetriNetUnfolder]: 2/38 cut-off events. [2021-03-26 10:29:09,211 INFO L130 PetriNetUnfolder]: For 55/57 co-relation queries the response was YES. [2021-03-26 10:29:09,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 38 events. 2/38 cut-off events. For 55/57 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 106 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 86. Up to 9 conditions per place. [2021-03-26 10:29:09,211 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-26 10:29:09,240 INFO L154 LiptonReduction]: Checked pairs total: 170 [2021-03-26 10:29:09,240 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:29:09,240 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-26 10:29:09,245 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 121 flow [2021-03-26 10:29:09,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states 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 10:29:09,246 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:09,246 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:09,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:29:09,246 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:09,247 INFO L82 PathProgramCache]: Analyzing trace with hash -330097415, now seen corresponding path program 1 times [2021-03-26 10:29:09,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:09,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214311811] [2021-03-26 10:29:09,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:09,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:09,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:09,328 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:29:09,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:29:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:29:09,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214311811] [2021-03-26 10:29:09,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:09,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:29:09,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832652332] [2021-03-26 10:29:09,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:29:09,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:29:09,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:29:09,343 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 172 [2021-03-26 10:29:09,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:09,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 172 [2021-03-26 10:29:09,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:09,384 INFO L129 PetriNetUnfolder]: 8/80 cut-off events. [2021-03-26 10:29:09,384 INFO L130 PetriNetUnfolder]: For 176/179 co-relation queries the response was YES. [2021-03-26 10:29:09,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 80 events. 8/80 cut-off events. For 176/179 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 374 event pairs, 2 based on Foata normal form. 5/82 useless extension candidates. Maximal degree in co-relation 223. Up to 18 conditions per place. [2021-03-26 10:29:09,385 INFO L132 encePairwiseOnDemand]: 165/172 looper letters, 6 selfloop transitions, 6 changer transitions 8/33 dead transitions. [2021-03-26 10:29:09,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 225 flow [2021-03-26 10:29:09,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:29:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:29:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2021-03-26 10:29:09,388 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8174418604651162 [2021-03-26 10:29:09,388 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 703 transitions. [2021-03-26 10:29:09,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 703 transitions. [2021-03-26 10:29:09,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:09,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 703 transitions. [2021-03-26 10:29:09,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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 10:29:09,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,392 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,392 INFO L185 Difference]: Start difference. First operand has 41 places, 24 transitions, 121 flow. Second operand 5 states and 703 transitions. [2021-03-26 10:29:09,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 225 flow [2021-03-26 10:29:09,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 179 flow, removed 11 selfloop flow, removed 6 redundant places. [2021-03-26 10:29:09,394 INFO L241 Difference]: Finished difference. Result has 42 places, 24 transitions, 126 flow [2021-03-26 10:29:09,394 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2021-03-26 10:29:09,394 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2021-03-26 10:29:09,394 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:09,394 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 24 transitions, 126 flow [2021-03-26 10:29:09,394 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 24 transitions, 126 flow [2021-03-26 10:29:09,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 24 transitions, 126 flow [2021-03-26 10:29:09,400 INFO L129 PetriNetUnfolder]: 2/39 cut-off events. [2021-03-26 10:29:09,400 INFO L130 PetriNetUnfolder]: For 56/58 co-relation queries the response was YES. [2021-03-26 10:29:09,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 39 events. 2/39 cut-off events. For 56/58 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 112 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 94. Up to 9 conditions per place. [2021-03-26 10:29:09,401 INFO L142 LiptonReduction]: Number of co-enabled transitions 186 [2021-03-26 10:29:09,453 INFO L154 LiptonReduction]: Checked pairs total: 183 [2021-03-26 10:29:09,453 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:29:09,453 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-26 10:29:09,454 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 126 flow [2021-03-26 10:29:09,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,454 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:09,454 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:29:09,455 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:29:09,455 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:09,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:09,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1694054577, now seen corresponding path program 2 times [2021-03-26 10:29:09,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:09,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727809582] [2021-03-26 10:29:09,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:09,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:09,516 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:29:09,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:29:09,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:29:09,523 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 10:29:09,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727809582] [2021-03-26 10:29:09,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:09,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:29:09,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641284130] [2021-03-26 10:29:09,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:29:09,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:09,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:29:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:29:09,525 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 172 [2021-03-26 10:29:09,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states 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 10:29:09,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:09,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 172 [2021-03-26 10:29:09,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:09,612 INFO L129 PetriNetUnfolder]: 92/206 cut-off events. [2021-03-26 10:29:09,612 INFO L130 PetriNetUnfolder]: For 193/223 co-relation queries the response was YES. [2021-03-26 10:29:09,613 INFO L84 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 206 events. 92/206 cut-off events. For 193/223 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1011 event pairs, 36 based on Foata normal form. 25/214 useless extension candidates. Maximal degree in co-relation 474. Up to 130 conditions per place. [2021-03-26 10:29:09,614 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 5 selfloop transitions, 4 changer transitions 7/34 dead transitions. [2021-03-26 10:29:09,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 178 flow [2021-03-26 10:29:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:29:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:29:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2021-03-26 10:29:09,616 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8523255813953489 [2021-03-26 10:29:09,616 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2021-03-26 10:29:09,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2021-03-26 10:29:09,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:09,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2021-03-26 10:29:09,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states 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 10:29:09,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,620 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,620 INFO L185 Difference]: Start difference. First operand has 42 places, 24 transitions, 126 flow. Second operand 5 states and 733 transitions. [2021-03-26 10:29:09,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 178 flow [2021-03-26 10:29:09,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 152 flow, removed 4 selfloop flow, removed 6 redundant places. [2021-03-26 10:29:09,622 INFO L241 Difference]: Finished difference. Result has 43 places, 27 transitions, 136 flow [2021-03-26 10:29:09,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2021-03-26 10:29:09,622 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-26 10:29:09,622 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:09,623 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 27 transitions, 136 flow [2021-03-26 10:29:09,623 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 27 transitions, 136 flow [2021-03-26 10:29:09,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 27 transitions, 136 flow [2021-03-26 10:29:09,637 INFO L129 PetriNetUnfolder]: 77/170 cut-off events. [2021-03-26 10:29:09,637 INFO L130 PetriNetUnfolder]: For 136/169 co-relation queries the response was YES. [2021-03-26 10:29:09,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 170 events. 77/170 cut-off events. For 136/169 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 788 event pairs, 35 based on Foata normal form. 3/158 useless extension candidates. Maximal degree in co-relation 477. Up to 114 conditions per place. [2021-03-26 10:29:09,639 INFO L142 LiptonReduction]: Number of co-enabled transitions 196 [2021-03-26 10:29:09,642 INFO L154 LiptonReduction]: Checked pairs total: 97 [2021-03-26 10:29:09,643 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:29:09,643 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 10:29:09,643 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 136 flow [2021-03-26 10:29:09,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states 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 10:29:09,644 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:09,644 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 10:29:09,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:29:09,644 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2138426342, now seen corresponding path program 1 times [2021-03-26 10:29:09,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:09,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614993932] [2021-03-26 10:29:09,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:09,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:09,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:09,721 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:29:09,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:29:09,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:29:09,729 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 10:29:09,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614993932] [2021-03-26 10:29:09,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:09,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:29:09,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248952421] [2021-03-26 10:29:09,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:29:09,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:09,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:29:09,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:29:09,731 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 172 [2021-03-26 10:29:09,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states 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 10:29:09,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:09,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 172 [2021-03-26 10:29:09,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:09,785 INFO L129 PetriNetUnfolder]: 53/147 cut-off events. [2021-03-26 10:29:09,785 INFO L130 PetriNetUnfolder]: For 173/241 co-relation queries the response was YES. [2021-03-26 10:29:09,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 147 events. 53/147 cut-off events. For 173/241 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 637 event pairs, 6 based on Foata normal form. 41/183 useless extension candidates. Maximal degree in co-relation 519. Up to 101 conditions per place. [2021-03-26 10:29:09,786 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 5 selfloop transitions, 7 changer transitions 7/37 dead transitions. [2021-03-26 10:29:09,786 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 232 flow [2021-03-26 10:29:09,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:29:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:29:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2021-03-26 10:29:09,789 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8517441860465116 [2021-03-26 10:29:09,789 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 879 transitions. [2021-03-26 10:29:09,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 879 transitions. [2021-03-26 10:29:09,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:09,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 879 transitions. [2021-03-26 10:29:09,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 0 states have call successors, (0), 0 states 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 10:29:09,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states 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 10:29:09,793 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 172.0) internal successors, (1204), 7 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states 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 10:29:09,793 INFO L185 Difference]: Start difference. First operand has 41 places, 27 transitions, 136 flow. Second operand 6 states and 879 transitions. [2021-03-26 10:29:09,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 232 flow [2021-03-26 10:29:09,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 221 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 10:29:09,796 INFO L241 Difference]: Finished difference. Result has 46 places, 30 transitions, 181 flow [2021-03-26 10:29:09,796 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2021-03-26 10:29:09,796 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2021-03-26 10:29:09,796 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:09,796 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 30 transitions, 181 flow [2021-03-26 10:29:09,797 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 30 transitions, 181 flow [2021-03-26 10:29:09,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 30 transitions, 181 flow [2021-03-26 10:29:09,808 INFO L129 PetriNetUnfolder]: 39/113 cut-off events. [2021-03-26 10:29:09,808 INFO L130 PetriNetUnfolder]: For 234/260 co-relation queries the response was YES. [2021-03-26 10:29:09,808 INFO L84 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 113 events. 39/113 cut-off events. For 234/260 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 419 event pairs, 8 based on Foata normal form. 8/118 useless extension candidates. Maximal degree in co-relation 426. Up to 67 conditions per place. [2021-03-26 10:29:09,809 INFO L142 LiptonReduction]: Number of co-enabled transitions 188 [2021-03-26 10:29:09,812 INFO L154 LiptonReduction]: Checked pairs total: 125 [2021-03-26 10:29:09,812 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:29:09,812 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-26 10:29:09,812 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 181 flow [2021-03-26 10:29:09,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states 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 10:29:09,813 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:09,813 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 10:29:09,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:29:09,813 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:09,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:09,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1970214030, now seen corresponding path program 1 times [2021-03-26 10:29:09,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:09,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790320825] [2021-03-26 10:29:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:29:09,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:09,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:09,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:29:09,897 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:29:09,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:29:09,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:29:09,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:29:09,906 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 10:29:09,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790320825] [2021-03-26 10:29:09,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:29:09,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:29:09,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938869523] [2021-03-26 10:29:09,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:29:09,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:29:09,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:29:09,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:29:09,908 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 172 [2021-03-26 10:29:09,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:29:09,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 172 [2021-03-26 10:29:09,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:29:09,962 INFO L129 PetriNetUnfolder]: 22/86 cut-off events. [2021-03-26 10:29:09,962 INFO L130 PetriNetUnfolder]: For 257/319 co-relation queries the response was YES. [2021-03-26 10:29:09,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 86 events. 22/86 cut-off events. For 257/319 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 297 event pairs, 0 based on Foata normal form. 40/123 useless extension candidates. Maximal degree in co-relation 368. Up to 57 conditions per place. [2021-03-26 10:29:09,963 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 2 selfloop transitions, 10 changer transitions 4/34 dead transitions. [2021-03-26 10:29:09,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 34 transitions, 249 flow [2021-03-26 10:29:09,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:29:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:29:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1019 transitions. [2021-03-26 10:29:09,966 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8463455149501661 [2021-03-26 10:29:09,966 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1019 transitions. [2021-03-26 10:29:09,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1019 transitions. [2021-03-26 10:29:09,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:29:09,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1019 transitions. [2021-03-26 10:29:09,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.57142857142858) internal successors, (1019), 7 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states 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 10:29:09,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,973 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:09,973 INFO L185 Difference]: Start difference. First operand has 44 places, 30 transitions, 181 flow. Second operand 7 states and 1019 transitions. [2021-03-26 10:29:09,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 34 transitions, 249 flow [2021-03-26 10:29:09,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 207 flow, removed 16 selfloop flow, removed 5 redundant places. [2021-03-26 10:29:09,977 INFO L241 Difference]: Finished difference. Result has 48 places, 30 transitions, 177 flow [2021-03-26 10:29:09,978 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2021-03-26 10:29:09,978 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2021-03-26 10:29:09,978 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:29:09,979 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 30 transitions, 177 flow [2021-03-26 10:29:09,979 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 177 flow [2021-03-26 10:29:09,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 30 transitions, 177 flow [2021-03-26 10:29:09,991 INFO L129 PetriNetUnfolder]: 16/68 cut-off events. [2021-03-26 10:29:09,992 INFO L130 PetriNetUnfolder]: For 107/113 co-relation queries the response was YES. [2021-03-26 10:29:09,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 68 events. 16/68 cut-off events. For 107/113 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 196 event pairs, 0 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 216. Up to 31 conditions per place. [2021-03-26 10:29:09,993 INFO L142 LiptonReduction]: Number of co-enabled transitions 140 [2021-03-26 10:29:10,275 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:29:10,395 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:29:10,715 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:29:10,881 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:29:10,885 INFO L154 LiptonReduction]: Checked pairs total: 285 [2021-03-26 10:29:10,886 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:29:10,886 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 908 [2021-03-26 10:29:10,886 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 187 flow [2021-03-26 10:29:10,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:29:10,887 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:29:10,887 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] [2021-03-26 10:29:10,887 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:29:10,887 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:29:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:29:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1317742455, now seen corresponding path program 1 times [2021-03-26 10:29:10,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:29:10,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816751976] [2021-03-26 10:29:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:29:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:29:10,924 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:29:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:29:10,962 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:29:10,999 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:29:10,999 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:29:10,999 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:29:11,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:29:11 BasicIcfg [2021-03-26 10:29:11,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:29:11,104 INFO L168 Benchmark]: Toolchain (without parser) took 11227.69 ms. Allocated memory was 255.9 MB in the beginning and 572.5 MB in the end (delta: 316.7 MB). Free memory was 233.4 MB in the beginning and 504.2 MB in the end (delta: -270.7 MB). Peak memory consumption was 47.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:11,104 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:29:11,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.25 ms. Allocated memory was 255.9 MB in the beginning and 385.9 MB in the end (delta: 130.0 MB). Free memory was 233.0 MB in the beginning and 345.2 MB in the end (delta: -112.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:11,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.45 ms. Allocated memory is still 385.9 MB. Free memory was 345.2 MB in the beginning and 343.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:11,105 INFO L168 Benchmark]: Boogie Preprocessor took 53.79 ms. Allocated memory is still 385.9 MB. Free memory was 343.1 MB in the beginning and 341.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:11,105 INFO L168 Benchmark]: RCFGBuilder took 1841.71 ms. Allocated memory is still 385.9 MB. Free memory was 340.5 MB in the beginning and 355.1 MB in the end (delta: -14.6 MB). Peak memory consumption was 67.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:11,105 INFO L168 Benchmark]: TraceAbstraction took 8705.57 ms. Allocated memory was 385.9 MB in the beginning and 572.5 MB in the end (delta: 186.6 MB). Free memory was 354.2 MB in the beginning and 504.2 MB in the end (delta: -149.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:29:11,111 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 550.25 ms. Allocated memory was 255.9 MB in the beginning and 385.9 MB in the end (delta: 130.0 MB). Free memory was 233.0 MB in the beginning and 345.2 MB in the end (delta: -112.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 68.45 ms. Allocated memory is still 385.9 MB. Free memory was 345.2 MB in the beginning and 343.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 53.79 ms. Allocated memory is still 385.9 MB. Free memory was 343.1 MB in the beginning and 341.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1841.71 ms. Allocated memory is still 385.9 MB. Free memory was 340.5 MB in the beginning and 355.1 MB in the end (delta: -14.6 MB). Peak memory consumption was 67.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8705.57 ms. Allocated memory was 385.9 MB in the beginning and 572.5 MB in the end (delta: 186.6 MB). Free memory was 354.2 MB in the beginning and 504.2 MB in the end (delta: -149.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2996.4ms, 102 PlacesBefore, 46 PlacesAfterwards, 94 TransitionsBefore, 37 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 4 FixpointIterations, 28 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 63 TotalNumberOfCompositions, 2292 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1285, positive: 1231, positive conditional: 1231, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1285, positive: 1231, positive conditional: 0, positive unconditional: 1231, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1285, positive: 1231, positive conditional: 0, positive unconditional: 1231, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1046, positive: 1013, positive conditional: 0, positive unconditional: 1013, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1046, positive: 1007, positive conditional: 0, positive unconditional: 1007, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 485, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 466, negative conditional: 0, negative unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1285, positive: 218, positive conditional: 0, positive unconditional: 218, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 1046, unknown conditional: 0, unknown unconditional: 1046] , Statistics on independence cache: Total cache size (in pairs): 1046, Positive cache size: 1013, Positive conditional cache size: 0, Positive unconditional cache size: 1013, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2387.1ms, 43 PlacesBefore, 32 PlacesAfterwards, 34 TransitionsBefore, 23 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 5 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1420 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 453, positive: 357, positive conditional: 357, positive unconditional: 0, negative: 96, negative conditional: 96, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 453, positive: 357, positive conditional: 9, positive unconditional: 348, negative: 96, negative conditional: 5, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 453, positive: 357, positive conditional: 9, positive unconditional: 348, negative: 96, negative conditional: 5, negative unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 106, positive: 99, positive conditional: 3, positive unconditional: 96, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 106, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 109, negative conditional: 38, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 453, positive: 258, positive conditional: 6, positive unconditional: 252, negative: 89, negative conditional: 4, negative unconditional: 85, unknown: 106, unknown conditional: 4, unknown unconditional: 102] , Statistics on independence cache: Total cache size (in pairs): 1152, Positive cache size: 1112, Positive conditional cache size: 3, Positive unconditional cache size: 1109, Negative cache size: 40, Negative conditional cache size: 1, Negative unconditional cache size: 39, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.9ms, 35 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 215 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, positive: 66, positive conditional: 66, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 1170, Positive cache size: 1126, Positive conditional cache size: 3, Positive unconditional cache size: 1123, Negative cache size: 44, Negative conditional cache size: 1, Negative unconditional cache size: 43, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.1ms, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 188 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 15, negative conditional: 2, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 15, negative conditional: 2, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 34, negative conditional: 5, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1176, Positive cache size: 1129, Positive conditional cache size: 3, Positive unconditional cache size: 1126, Negative cache size: 47, Negative conditional cache size: 3, Negative unconditional cache size: 44, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 54.7ms, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 190 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, positive: 93, positive conditional: 93, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 16, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 43, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 1192, Positive cache size: 1143, Positive conditional cache size: 3, Positive unconditional cache size: 1140, Negative cache size: 49, Negative conditional cache size: 3, Negative unconditional cache size: 46, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.8ms, 39 PlacesBefore, 39 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 193 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 21, negative conditional: 2, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 21, negative conditional: 2, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1194, Positive cache size: 1143, Positive conditional cache size: 3, Positive unconditional cache size: 1140, Negative cache size: 51, Negative conditional cache size: 5, Negative unconditional cache size: 46, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.9ms, 43 PlacesBefore, 41 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 170 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, positive: 58, positive conditional: 58, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 14, negative conditional: 1, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 14, negative conditional: 1, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, 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: 3, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1199, Positive cache size: 1146, Positive conditional cache size: 3, Positive unconditional cache size: 1143, Negative cache size: 53, Negative conditional cache size: 6, Negative unconditional cache size: 47, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.7ms, 42 PlacesBefore, 42 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 183 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 69, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 69, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 69, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 69, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1202, Positive cache size: 1147, Positive conditional cache size: 3, Positive unconditional cache size: 1144, Negative cache size: 55, Negative conditional cache size: 6, Negative unconditional cache size: 49, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.9ms, 43 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 97 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, positive: 12, positive conditional: 6, positive unconditional: 6, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 12, positive conditional: 6, positive unconditional: 6, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 20, positive: 10, positive conditional: 5, positive unconditional: 5, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1204, Positive cache size: 1149, Positive conditional cache size: 4, Positive unconditional cache size: 1145, Negative cache size: 55, Negative conditional cache size: 6, Negative unconditional cache size: 49, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.3ms, 46 PlacesBefore, 44 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 125 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 14, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1204, Positive cache size: 1149, Positive conditional cache size: 4, Positive unconditional cache size: 1145, Negative cache size: 55, Negative conditional cache size: 6, Negative unconditional cache size: 49, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 906.7ms, 48 PlacesBefore, 45 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 285 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 48, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1204, Positive cache size: 1149, Positive conditional cache size: 4, Positive unconditional cache size: 1145, Negative cache size: 55, Negative conditional cache size: 6, Negative unconditional cache size: 49, Eliminated conditions: 6 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1900; [L832] FCALL, FORK 0 pthread_create(&t1900, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1901; [L834] FCALL, FORK 0 pthread_create(&t1901, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L835] 0 pthread_t t1902; [L836] FCALL, FORK 0 pthread_create(&t1902, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8473.5ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 640.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3068.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49 SDtfs, 28 SDslu, 25 SDs, 0 SdLazy, 149 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 163.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 132.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=10, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 32.8ms SsaConstructionTime, 360.5ms SatisfiabilityAnalysisTime, 531.0ms InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...