/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/safe017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 16:14:11,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 16:14:11,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 16:14:11,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 16:14:11,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 16:14:11,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 16:14:11,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 16:14:11,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 16:14:11,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 16:14:11,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 16:14:11,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 16:14:11,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 16:14:11,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 16:14:11,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 16:14:11,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 16:14:11,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 16:14:11,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 16:14:11,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 16:14:11,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 16:14:11,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 16:14:11,514 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 16:14:11,515 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 16:14:11,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 16:14:11,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 16:14:11,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 16:14:11,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 16:14:11,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 16:14:11,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 16:14:11,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 16:14:11,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 16:14:11,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 16:14:11,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 16:14:11,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 16:14:11,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 16:14:11,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 16:14:11,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 16:14:11,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 16:14:11,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 16:14:11,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 16:14:11,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 16:14:11,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 16:14:11,535 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-06-11 16:14:11,567 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 16:14:11,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 16:14:11,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 16:14:11,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 16:14:11,570 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 16:14:11,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 16:14:11,571 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 16:14:11,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 16:14:11,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 16:14:11,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 16:14:11,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 16:14:11,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 16:14:11,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 16:14:11,572 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 16:14:11,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 16:14:11,572 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 16:14:11,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 16:14:11,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 16:14:11,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 16:14:11,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 16:14:11,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 16:14:11,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 16:14:11,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 16:14:11,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 16:14:11,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 16:14:11,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 16:14:11,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 16:14:11,574 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 16:14:11,574 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 16:14:11,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 16:14:11,575 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-06-11 16:14:11,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 16:14:11,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 16:14:11,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 16:14:11,878 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 16:14:11,879 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 16:14:11,879 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2021-06-11 16:14:11,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993a4e06f/66743c04d6914e12889343437673df46/FLAG684af35ba [2021-06-11 16:14:12,321 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 16:14:12,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2021-06-11 16:14:12,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993a4e06f/66743c04d6914e12889343437673df46/FLAG684af35ba [2021-06-11 16:14:12,652 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/993a4e06f/66743c04d6914e12889343437673df46 [2021-06-11 16:14:12,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 16:14:12,656 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 16:14:12,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 16:14:12,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 16:14:12,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 16:14:12,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:14:12" (1/1) ... [2021-06-11 16:14:12,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39220b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:12, skipping insertion in model container [2021-06-11 16:14:12,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:14:12" (1/1) ... [2021-06-11 16:14:12,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 16:14:12,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 16:14:12,876 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/safe017_power.opt.i[951,964] [2021-06-11 16:14:13,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:14:13,027 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 16:14:13,053 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/safe017_power.opt.i[951,964] [2021-06-11 16:14:13,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:14:13,151 INFO L208 MainTranslator]: Completed translation [2021-06-11 16:14:13,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13 WrapperNode [2021-06-11 16:14:13,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 16:14:13,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 16:14:13,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 16:14:13,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 16:14:13,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (1/1) ... [2021-06-11 16:14:13,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (1/1) ... [2021-06-11 16:14:13,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 16:14:13,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 16:14:13,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 16:14:13,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 16:14:13,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (1/1) ... [2021-06-11 16:14:13,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (1/1) ... [2021-06-11 16:14:13,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (1/1) ... [2021-06-11 16:14:13,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (1/1) ... [2021-06-11 16:14:13,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (1/1) ... [2021-06-11 16:14:13,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (1/1) ... [2021-06-11 16:14:13,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (1/1) ... [2021-06-11 16:14:13,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 16:14:13,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 16:14:13,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 16:14:13,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 16:14:13,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (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-06-11 16:14:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 16:14:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 16:14:13,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 16:14:13,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 16:14:13,306 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 16:14:13,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 16:14:13,306 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 16:14:13,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 16:14:13,306 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 16:14:13,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 16:14:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 16:14:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 16:14:13,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 16:14:13,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 16:14:13,308 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 16:14:14,879 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 16:14:14,879 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 16:14:14,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:14:14 BoogieIcfgContainer [2021-06-11 16:14:14,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 16:14:14,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 16:14:14,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 16:14:14,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 16:14:14,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 04:14:12" (1/3) ... [2021-06-11 16:14:14,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9a352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:14:14, skipping insertion in model container [2021-06-11 16:14:14,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:13" (2/3) ... [2021-06-11 16:14:14,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9a352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:14:14, skipping insertion in model container [2021-06-11 16:14:14,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:14:14" (3/3) ... [2021-06-11 16:14:14,886 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.opt.i [2021-06-11 16:14:14,892 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 16:14:14,895 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 16:14:14,896 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 16:14:14,920 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,921 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,921 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,922 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,922 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,922 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,922 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,924 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,925 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,925 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,925 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,926 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,926 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,928 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,928 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,929 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,929 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,929 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,929 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,929 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,938 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,939 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,939 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:14,940 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 16:14:14,954 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 16:14:14,972 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 16:14:14,972 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 16:14:14,972 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 16:14:14,972 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 16:14:14,972 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 16:14:14,973 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 16:14:14,973 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 16:14:14,973 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 16:14:14,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2021-06-11 16:14:15,036 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2021-06-11 16:14:15,037 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:14:15,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-11 16:14:15,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2021-06-11 16:14:15,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2021-06-11 16:14:15,046 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:15,059 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 193 flow [2021-06-11 16:14:15,064 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 193 flow [2021-06-11 16:14:15,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 193 flow [2021-06-11 16:14:15,096 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2021-06-11 16:14:15,096 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:14:15,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-11 16:14:15,100 INFO L151 LiptonReduction]: Number of co-enabled transitions 1602 [2021-06-11 16:14:15,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:15,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:15,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:15,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:15,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:15,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:15,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:15,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,807 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 16:14:15,807 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:14:15,831 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:15,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,256 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:16,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:16,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:16,319 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 16:14:16,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:16,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:16,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:16,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:16,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:16,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:17,120 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 16:14:17,516 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 16:14:17,640 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 16:14:17,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:17,665 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:17,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:17,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:14:17,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:17,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:17,671 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 16:14:17,671 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:14:17,674 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:17,676 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 16:14:17,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:17,678 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 16:14:17,679 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 16:14:17,679 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:14:17,680 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:17,682 INFO L147 QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50 [2021-06-11 16:14:17,683 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 16:14:17,683 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:14:17,685 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:17,687 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 16:14:17,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:17,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:18,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:18,020 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:18,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:18,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:18,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:18,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:18,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:18,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:18,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:18,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:18,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:18,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:18,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:18,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:18,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:18,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:18,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:18,275 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 16:14:18,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:18,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:19,445 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 239 DAG size of output: 198 [2021-06-11 16:14:19,758 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 16:14:21,178 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 323 DAG size of output: 278 [2021-06-11 16:14:21,796 WARN L205 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-06-11 16:14:21,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:21,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:22,430 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2021-06-11 16:14:22,753 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 16:14:24,061 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 313 DAG size of output: 269 [2021-06-11 16:14:24,585 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-06-11 16:14:25,174 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-06-11 16:14:25,439 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-06-11 16:14:26,705 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-06-11 16:14:27,242 WARN L205 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-06-11 16:14:27,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:27,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:27,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:27,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:27,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:27,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:27,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:27,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:27,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:27,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 16:14:27,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:27,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:27,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:27,526 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:27,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:27,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 16:14:27,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 16:14:27,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:27,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:27,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 16:14:27,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 16:14:27,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:27,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:27,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:27,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:27,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:28,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:28,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:28,345 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-06-11 16:14:28,622 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-06-11 16:14:29,436 WARN L205 SmtUtils]: Spent 812.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-06-11 16:14:30,083 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-06-11 16:14:30,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:30,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:30,392 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-06-11 16:14:30,504 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-11 16:14:30,757 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-06-11 16:14:30,875 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-11 16:14:30,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:30,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:30,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:30,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:30,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:30,917 INFO L163 LiptonReduction]: Checked pairs total: 4098 [2021-06-11 16:14:30,917 INFO L165 LiptonReduction]: Total number of compositions: 86 [2021-06-11 16:14:30,919 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15874 [2021-06-11 16:14:30,925 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2021-06-11 16:14:30,925 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:14:30,925 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:30,926 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-11 16:14:30,926 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:30,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1056835, now seen corresponding path program 1 times [2021-06-11 16:14:30,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:30,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304913812] [2021-06-11 16:14:30,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:31,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:31,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:31,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304913812] [2021-06-11 16:14:31,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:31,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:14:31,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109677997] [2021-06-11 16:14:31,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:14:31,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:31,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:14:31,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:14:31,146 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 181 [2021-06-11 16:14:31,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:31,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 181 [2021-06-11 16:14:31,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:31,227 INFO L129 PetriNetUnfolder]: 69/165 cut-off events. [2021-06-11 16:14:31,227 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:14:31,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 165 events. 69/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 797 event pairs, 13 based on Foata normal form. 10/152 useless extension candidates. Maximal degree in co-relation 283. Up to 89 conditions per place. [2021-06-11 16:14:31,229 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 9 selfloop transitions, 2 changer transitions 3/29 dead transitions. [2021-06-11 16:14:31,229 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 93 flow [2021-06-11 16:14:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:14:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:14:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2021-06-11 16:14:31,241 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8324125230202578 [2021-06-11 16:14:31,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2021-06-11 16:14:31,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2021-06-11 16:14:31,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:31,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2021-06-11 16:14:31,248 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-06-11 16:14:31,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,254 INFO L185 Difference]: Start difference. First operand has 36 places, 28 transitions, 65 flow. Second operand 3 states and 452 transitions. [2021-06-11 16:14:31,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 93 flow [2021-06-11 16:14:31,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 90 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 16:14:31,258 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2021-06-11 16:14:31,259 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-06-11 16:14:31,259 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2021-06-11 16:14:31,260 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:31,260 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 54 flow [2021-06-11 16:14:31,260 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 54 flow [2021-06-11 16:14:31,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2021-06-11 16:14:31,263 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-06-11 16:14:31,264 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:14:31,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 16:14:31,264 INFO L151 LiptonReduction]: Number of co-enabled transitions 226 [2021-06-11 16:14:31,398 INFO L163 LiptonReduction]: Checked pairs total: 234 [2021-06-11 16:14:31,398 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:31,398 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 138 [2021-06-11 16:14:31,399 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-06-11 16:14:31,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,399 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:31,399 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:14:31,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 16:14:31,400 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:31,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:31,400 INFO L82 PathProgramCache]: Analyzing trace with hash 294922873, now seen corresponding path program 1 times [2021-06-11 16:14:31,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:31,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044631203] [2021-06-11 16:14:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:31,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:31,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:31,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:31,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044631203] [2021-06-11 16:14:31,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:31,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:14:31,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319620393] [2021-06-11 16:14:31,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:14:31,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:31,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:14:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:14:31,484 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 181 [2021-06-11 16:14:31,484 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:31,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 181 [2021-06-11 16:14:31,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:31,494 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-06-11 16:14:31,494 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:14:31,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 1/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 16:14:31,494 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 1 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2021-06-11 16:14:31,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 60 flow [2021-06-11 16:14:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:14:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:14:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-06-11 16:14:31,497 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8416206261510129 [2021-06-11 16:14:31,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-06-11 16:14:31,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-06-11 16:14:31,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:31,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-06-11 16:14:31,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,501 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 457 transitions. [2021-06-11 16:14:31,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 60 flow [2021-06-11 16:14:31,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:14:31,501 INFO L241 Difference]: Finished difference. Result has 32 places, 20 transitions, 54 flow [2021-06-11 16:14:31,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2021-06-11 16:14:31,502 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2021-06-11 16:14:31,502 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:31,502 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 54 flow [2021-06-11 16:14:31,503 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 20 transitions, 54 flow [2021-06-11 16:14:31,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2021-06-11 16:14:31,506 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-06-11 16:14:31,506 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:14:31,506 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 4. Compared 28 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-06-11 16:14:31,506 INFO L151 LiptonReduction]: Number of co-enabled transitions 188 [2021-06-11 16:14:31,723 INFO L163 LiptonReduction]: Checked pairs total: 209 [2021-06-11 16:14:31,724 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:31,724 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 222 [2021-06-11 16:14:31,728 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-06-11 16:14:31,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,728 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:31,728 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:14:31,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 16:14:31,729 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:31,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:31,729 INFO L82 PathProgramCache]: Analyzing trace with hash 552155161, now seen corresponding path program 1 times [2021-06-11 16:14:31,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:31,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989242797] [2021-06-11 16:14:31,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:31,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:31,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:31,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:31,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:31,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:31,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989242797] [2021-06-11 16:14:31,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:31,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:14:31,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618700736] [2021-06-11 16:14:31,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:14:31,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:31,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:14:31,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:14:31,861 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 181 [2021-06-11 16:14:31,862 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,862 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:31,862 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 181 [2021-06-11 16:14:31,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:31,896 INFO L129 PetriNetUnfolder]: 6/52 cut-off events. [2021-06-11 16:14:31,897 INFO L130 PetriNetUnfolder]: For 9/20 co-relation queries the response was YES. [2021-06-11 16:14:31,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 52 events. 6/52 cut-off events. For 9/20 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 4/55 useless extension candidates. Maximal degree in co-relation 84. Up to 11 conditions per place. [2021-06-11 16:14:31,898 INFO L132 encePairwiseOnDemand]: 176/181 looper letters, 5 selfloop transitions, 4 changer transitions 1/25 dead transitions. [2021-06-11 16:14:31,898 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 25 transitions, 87 flow [2021-06-11 16:14:31,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:14:31,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:14:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2021-06-11 16:14:31,901 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8121546961325967 [2021-06-11 16:14:31,901 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 588 transitions. [2021-06-11 16:14:31,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 588 transitions. [2021-06-11 16:14:31,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:31,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 588 transitions. [2021-06-11 16:14:31,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,904 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:31,904 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 588 transitions. [2021-06-11 16:14:31,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 25 transitions, 87 flow [2021-06-11 16:14:31,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 81 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:14:31,905 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 76 flow [2021-06-11 16:14:31,906 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-06-11 16:14:31,906 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2021-06-11 16:14:31,906 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:31,906 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 76 flow [2021-06-11 16:14:31,907 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 76 flow [2021-06-11 16:14:31,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 76 flow [2021-06-11 16:14:31,914 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-06-11 16:14:31,914 INFO L130 PetriNetUnfolder]: For 7/10 co-relation queries the response was YES. [2021-06-11 16:14:31,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 34 events. 3/34 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2021-06-11 16:14:31,915 INFO L151 LiptonReduction]: Number of co-enabled transitions 198 [2021-06-11 16:14:32,053 INFO L163 LiptonReduction]: Checked pairs total: 161 [2021-06-11 16:14:32,053 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:32,053 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 147 [2021-06-11 16:14:32,054 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 76 flow [2021-06-11 16:14:32,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,054 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:32,055 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:14:32,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 16:14:32,055 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:32,055 INFO L82 PathProgramCache]: Analyzing trace with hash -46990682, now seen corresponding path program 1 times [2021-06-11 16:14:32,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:32,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687486272] [2021-06-11 16:14:32,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:32,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:32,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:14:32,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:32,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:14:32,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:32,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687486272] [2021-06-11 16:14:32,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:32,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:14:32,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959533267] [2021-06-11 16:14:32,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:14:32,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:32,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:14:32,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:14:32,183 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 181 [2021-06-11 16:14:32,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:32,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 181 [2021-06-11 16:14:32,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:32,268 INFO L129 PetriNetUnfolder]: 109/225 cut-off events. [2021-06-11 16:14:32,268 INFO L130 PetriNetUnfolder]: For 150/153 co-relation queries the response was YES. [2021-06-11 16:14:32,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 225 events. 109/225 cut-off events. For 150/153 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 962 event pairs, 36 based on Foata normal form. 6/216 useless extension candidates. Maximal degree in co-relation 508. Up to 160 conditions per place. [2021-06-11 16:14:32,273 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 10 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2021-06-11 16:14:32,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 124 flow [2021-06-11 16:14:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:14:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:14:32,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2021-06-11 16:14:32,276 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7320441988950276 [2021-06-11 16:14:32,276 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2021-06-11 16:14:32,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2021-06-11 16:14:32,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:32,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2021-06-11 16:14:32,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,279 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,279 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 76 flow. Second operand 4 states and 530 transitions. [2021-06-11 16:14:32,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 124 flow [2021-06-11 16:14:32,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 117 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 16:14:32,281 INFO L241 Difference]: Finished difference. Result has 36 places, 27 transitions, 110 flow [2021-06-11 16:14:32,281 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2021-06-11 16:14:32,282 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2021-06-11 16:14:32,282 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:32,282 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 110 flow [2021-06-11 16:14:32,282 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 110 flow [2021-06-11 16:14:32,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 110 flow [2021-06-11 16:14:32,295 INFO L129 PetriNetUnfolder]: 22/89 cut-off events. [2021-06-11 16:14:32,295 INFO L130 PetriNetUnfolder]: For 95/102 co-relation queries the response was YES. [2021-06-11 16:14:32,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 89 events. 22/89 cut-off events. For 95/102 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 399 event pairs, 7 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 207. Up to 39 conditions per place. [2021-06-11 16:14:32,297 INFO L151 LiptonReduction]: Number of co-enabled transitions 238 [2021-06-11 16:14:32,348 INFO L163 LiptonReduction]: Checked pairs total: 74 [2021-06-11 16:14:32,349 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:32,349 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-06-11 16:14:32,349 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 110 flow [2021-06-11 16:14:32,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,350 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:32,350 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:14:32,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 16:14:32,350 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:32,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:32,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1946713284, now seen corresponding path program 1 times [2021-06-11 16:14:32,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:32,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360453740] [2021-06-11 16:14:32,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:32,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:32,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:32,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:32,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:14:32,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:32,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:32,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360453740] [2021-06-11 16:14:32,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:32,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:14:32,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608282116] [2021-06-11 16:14:32,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:14:32,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:14:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:14:32,430 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 181 [2021-06-11 16:14:32,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:32,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 181 [2021-06-11 16:14:32,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:32,531 INFO L129 PetriNetUnfolder]: 98/219 cut-off events. [2021-06-11 16:14:32,531 INFO L130 PetriNetUnfolder]: For 295/322 co-relation queries the response was YES. [2021-06-11 16:14:32,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 219 events. 98/219 cut-off events. For 295/322 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 972 event pairs, 37 based on Foata normal form. 22/227 useless extension candidates. Maximal degree in co-relation 596. Up to 117 conditions per place. [2021-06-11 16:14:32,533 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 12 selfloop transitions, 12 changer transitions 0/38 dead transitions. [2021-06-11 16:14:32,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 190 flow [2021-06-11 16:14:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:14:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:14:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2021-06-11 16:14:32,536 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7337016574585635 [2021-06-11 16:14:32,536 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2021-06-11 16:14:32,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2021-06-11 16:14:32,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:32,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2021-06-11 16:14:32,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,540 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 110 flow. Second operand 5 states and 664 transitions. [2021-06-11 16:14:32,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 190 flow [2021-06-11 16:14:32,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 16:14:32,542 INFO L241 Difference]: Finished difference. Result has 43 places, 33 transitions, 188 flow [2021-06-11 16:14:32,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2021-06-11 16:14:32,543 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2021-06-11 16:14:32,543 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:32,543 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 188 flow [2021-06-11 16:14:32,543 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 188 flow [2021-06-11 16:14:32,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 188 flow [2021-06-11 16:14:32,563 INFO L129 PetriNetUnfolder]: 53/141 cut-off events. [2021-06-11 16:14:32,564 INFO L130 PetriNetUnfolder]: For 471/499 co-relation queries the response was YES. [2021-06-11 16:14:32,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 141 events. 53/141 cut-off events. For 471/499 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 653 event pairs, 8 based on Foata normal form. 2/131 useless extension candidates. Maximal degree in co-relation 504. Up to 75 conditions per place. [2021-06-11 16:14:32,565 INFO L151 LiptonReduction]: Number of co-enabled transitions 270 [2021-06-11 16:14:32,952 INFO L163 LiptonReduction]: Checked pairs total: 72 [2021-06-11 16:14:32,952 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:32,952 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 409 [2021-06-11 16:14:32,953 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 188 flow [2021-06-11 16:14:32,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:32,953 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:32,954 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:14:32,954 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 16:14:32,954 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:32,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:32,954 INFO L82 PathProgramCache]: Analyzing trace with hash 797153432, now seen corresponding path program 1 times [2021-06-11 16:14:32,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:32,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090771273] [2021-06-11 16:14:32,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:33,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:33,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:33,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090771273] [2021-06-11 16:14:33,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:33,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:14:33,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546767427] [2021-06-11 16:14:33,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:14:33,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:33,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:14:33,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:14:33,050 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 181 [2021-06-11 16:14:33,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:33,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 181 [2021-06-11 16:14:33,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:33,081 INFO L129 PetriNetUnfolder]: 45/147 cut-off events. [2021-06-11 16:14:33,081 INFO L130 PetriNetUnfolder]: For 584/663 co-relation queries the response was YES. [2021-06-11 16:14:33,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 147 events. 45/147 cut-off events. For 584/663 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 693 event pairs, 13 based on Foata normal form. 16/156 useless extension candidates. Maximal degree in co-relation 478. Up to 72 conditions per place. [2021-06-11 16:14:33,083 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 5 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2021-06-11 16:14:33,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 208 flow [2021-06-11 16:14:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:14:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:14:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2021-06-11 16:14:33,085 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8379373848987108 [2021-06-11 16:14:33,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2021-06-11 16:14:33,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2021-06-11 16:14:33,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:33,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2021-06-11 16:14:33,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,088 INFO L185 Difference]: Start difference. First operand has 43 places, 33 transitions, 188 flow. Second operand 3 states and 455 transitions. [2021-06-11 16:14:33,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 208 flow [2021-06-11 16:14:33,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 198 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 16:14:33,091 INFO L241 Difference]: Finished difference. Result has 45 places, 33 transitions, 189 flow [2021-06-11 16:14:33,091 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2021-06-11 16:14:33,091 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2021-06-11 16:14:33,092 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:33,092 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 189 flow [2021-06-11 16:14:33,092 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 189 flow [2021-06-11 16:14:33,092 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 189 flow [2021-06-11 16:14:33,111 INFO L129 PetriNetUnfolder]: 43/147 cut-off events. [2021-06-11 16:14:33,111 INFO L130 PetriNetUnfolder]: For 481/513 co-relation queries the response was YES. [2021-06-11 16:14:33,112 INFO L84 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 147 events. 43/147 cut-off events. For 481/513 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 724 event pairs, 9 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 471. Up to 75 conditions per place. [2021-06-11 16:14:33,113 INFO L151 LiptonReduction]: Number of co-enabled transitions 270 [2021-06-11 16:14:33,144 INFO L163 LiptonReduction]: Checked pairs total: 72 [2021-06-11 16:14:33,145 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:33,145 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-06-11 16:14:33,145 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 189 flow [2021-06-11 16:14:33,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:33,146 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:14:33,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 16:14:33,146 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:33,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:33,147 INFO L82 PathProgramCache]: Analyzing trace with hash 750602380, now seen corresponding path program 1 times [2021-06-11 16:14:33,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:33,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067017493] [2021-06-11 16:14:33,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:33,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:14:33,219 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-06-11 16:14:33,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:14:33,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:14:33,241 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-11 16:14:33,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 16:14:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:33,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067017493] [2021-06-11 16:14:33,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:33,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:14:33,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964486458] [2021-06-11 16:14:33,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:14:33,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:14:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:14:33,259 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 181 [2021-06-11 16:14:33,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:33,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 181 [2021-06-11 16:14:33,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:33,375 INFO L129 PetriNetUnfolder]: 107/247 cut-off events. [2021-06-11 16:14:33,375 INFO L130 PetriNetUnfolder]: For 683/733 co-relation queries the response was YES. [2021-06-11 16:14:33,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 247 events. 107/247 cut-off events. For 683/733 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1182 event pairs, 33 based on Foata normal form. 16/253 useless extension candidates. Maximal degree in co-relation 886. Up to 174 conditions per place. [2021-06-11 16:14:33,377 INFO L132 encePairwiseOnDemand]: 176/181 looper letters, 17 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2021-06-11 16:14:33,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 259 flow [2021-06-11 16:14:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:14:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:14:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2021-06-11 16:14:33,380 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7306629834254144 [2021-06-11 16:14:33,380 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2021-06-11 16:14:33,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2021-06-11 16:14:33,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:33,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2021-06-11 16:14:33,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,383 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,383 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 189 flow. Second operand 4 states and 529 transitions. [2021-06-11 16:14:33,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 259 flow [2021-06-11 16:14:33,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 242 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-06-11 16:14:33,388 INFO L241 Difference]: Finished difference. Result has 48 places, 35 transitions, 209 flow [2021-06-11 16:14:33,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=209, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2021-06-11 16:14:33,389 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2021-06-11 16:14:33,389 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:33,389 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 35 transitions, 209 flow [2021-06-11 16:14:33,389 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 35 transitions, 209 flow [2021-06-11 16:14:33,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 35 transitions, 209 flow [2021-06-11 16:14:33,408 INFO L129 PetriNetUnfolder]: 43/141 cut-off events. [2021-06-11 16:14:33,408 INFO L130 PetriNetUnfolder]: For 361/386 co-relation queries the response was YES. [2021-06-11 16:14:33,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 141 events. 43/141 cut-off events. For 361/386 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 661 event pairs, 12 based on Foata normal form. 3/140 useless extension candidates. Maximal degree in co-relation 438. Up to 71 conditions per place. [2021-06-11 16:14:33,410 INFO L151 LiptonReduction]: Number of co-enabled transitions 278 [2021-06-11 16:14:33,414 INFO L163 LiptonReduction]: Checked pairs total: 78 [2021-06-11 16:14:33,414 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:33,414 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-06-11 16:14:33,414 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 209 flow [2021-06-11 16:14:33,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,415 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:33,415 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:14:33,415 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 16:14:33,415 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:33,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:33,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1132330899, now seen corresponding path program 1 times [2021-06-11 16:14:33,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:33,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147219376] [2021-06-11 16:14:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:33,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:33,461 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:14:33,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:33,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:33,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147219376] [2021-06-11 16:14:33,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:33,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:14:33,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306525067] [2021-06-11 16:14:33,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:14:33,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:33,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:14:33,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:14:33,470 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 181 [2021-06-11 16:14:33,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:33,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 181 [2021-06-11 16:14:33,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:33,583 INFO L129 PetriNetUnfolder]: 153/375 cut-off events. [2021-06-11 16:14:33,583 INFO L130 PetriNetUnfolder]: For 723/764 co-relation queries the response was YES. [2021-06-11 16:14:33,584 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 375 events. 153/375 cut-off events. For 723/764 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2338 event pairs, 61 based on Foata normal form. 40/379 useless extension candidates. Maximal degree in co-relation 1051. Up to 191 conditions per place. [2021-06-11 16:14:33,586 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 8 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2021-06-11 16:14:33,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 261 flow [2021-06-11 16:14:33,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:14:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:14:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2021-06-11 16:14:33,588 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7933701657458564 [2021-06-11 16:14:33,588 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2021-06-11 16:14:33,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2021-06-11 16:14:33,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:33,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2021-06-11 16:14:33,590 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-06-11 16:14:33,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,592 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,592 INFO L185 Difference]: Start difference. First operand has 48 places, 35 transitions, 209 flow. Second operand 5 states and 718 transitions. [2021-06-11 16:14:33,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 261 flow [2021-06-11 16:14:33,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:14:33,595 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 260 flow [2021-06-11 16:14:33,595 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2021-06-11 16:14:33,595 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2021-06-11 16:14:33,595 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:33,595 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 260 flow [2021-06-11 16:14:33,596 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 260 flow [2021-06-11 16:14:33,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 260 flow [2021-06-11 16:14:33,636 INFO L129 PetriNetUnfolder]: 145/379 cut-off events. [2021-06-11 16:14:33,637 INFO L130 PetriNetUnfolder]: For 916/1069 co-relation queries the response was YES. [2021-06-11 16:14:33,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1274 conditions, 379 events. 145/379 cut-off events. For 916/1069 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2415 event pairs, 45 based on Foata normal form. 22/366 useless extension candidates. Maximal degree in co-relation 1251. Up to 183 conditions per place. [2021-06-11 16:14:33,641 INFO L151 LiptonReduction]: Number of co-enabled transitions 390 [2021-06-11 16:14:33,645 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:14:33,645 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:33,645 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-06-11 16:14:33,645 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 260 flow [2021-06-11 16:14:33,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,646 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:33,646 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:14:33,646 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 16:14:33,646 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:33,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1861405563, now seen corresponding path program 1 times [2021-06-11 16:14:33,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:33,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663074958] [2021-06-11 16:14:33,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:33,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:33,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:33,698 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:14:33,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:33,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:33,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663074958] [2021-06-11 16:14:33,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:33,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:14:33,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434055892] [2021-06-11 16:14:33,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:14:33,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:33,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:14:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:14:33,708 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 181 [2021-06-11 16:14:33,709 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:33,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 181 [2021-06-11 16:14:33,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:33,779 INFO L129 PetriNetUnfolder]: 92/280 cut-off events. [2021-06-11 16:14:33,779 INFO L130 PetriNetUnfolder]: For 612/995 co-relation queries the response was YES. [2021-06-11 16:14:33,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 280 events. 92/280 cut-off events. For 612/995 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1711 event pairs, 11 based on Foata normal form. 137/397 useless extension candidates. Maximal degree in co-relation 1051. Up to 158 conditions per place. [2021-06-11 16:14:33,781 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 15 changer transitions 3/52 dead transitions. [2021-06-11 16:14:33,781 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 52 transitions, 364 flow [2021-06-11 16:14:33,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:14:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:14:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1005 transitions. [2021-06-11 16:14:33,784 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7932123125493291 [2021-06-11 16:14:33,784 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1005 transitions. [2021-06-11 16:14:33,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1005 transitions. [2021-06-11 16:14:33,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:33,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1005 transitions. [2021-06-11 16:14:33,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.57142857142858) internal successors, (1005), 7 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,789 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,789 INFO L185 Difference]: Start difference. First operand has 53 places, 42 transitions, 260 flow. Second operand 7 states and 1005 transitions. [2021-06-11 16:14:33,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 52 transitions, 364 flow [2021-06-11 16:14:33,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:14:33,793 INFO L241 Difference]: Finished difference. Result has 61 places, 49 transitions, 355 flow [2021-06-11 16:14:33,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=355, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2021-06-11 16:14:33,793 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2021-06-11 16:14:33,793 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:33,794 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 49 transitions, 355 flow [2021-06-11 16:14:33,794 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 49 transitions, 355 flow [2021-06-11 16:14:33,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 355 flow [2021-06-11 16:14:33,823 INFO L129 PetriNetUnfolder]: 89/289 cut-off events. [2021-06-11 16:14:33,824 INFO L130 PetriNetUnfolder]: For 914/1010 co-relation queries the response was YES. [2021-06-11 16:14:33,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 289 events. 89/289 cut-off events. For 914/1010 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1832 event pairs, 9 based on Foata normal form. 6/283 useless extension candidates. Maximal degree in co-relation 1172. Up to 159 conditions per place. [2021-06-11 16:14:33,827 INFO L151 LiptonReduction]: Number of co-enabled transitions 424 [2021-06-11 16:14:33,832 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:14:33,832 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:33,832 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-06-11 16:14:33,833 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 355 flow [2021-06-11 16:14:33,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,833 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:33,833 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:14:33,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 16:14:33,834 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash -790111999, now seen corresponding path program 1 times [2021-06-11 16:14:33,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:33,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685137957] [2021-06-11 16:14:33,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:33,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:33,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:33,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:33,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:33,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685137957] [2021-06-11 16:14:33,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:33,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:14:33,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994613766] [2021-06-11 16:14:33,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:14:33,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:33,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:14:33,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:14:33,876 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 181 [2021-06-11 16:14:33,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:33,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 181 [2021-06-11 16:14:33,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:33,945 INFO L129 PetriNetUnfolder]: 152/463 cut-off events. [2021-06-11 16:14:33,945 INFO L130 PetriNetUnfolder]: For 1775/2207 co-relation queries the response was YES. [2021-06-11 16:14:33,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 463 events. 152/463 cut-off events. For 1775/2207 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 3333 event pairs, 18 based on Foata normal form. 17/447 useless extension candidates. Maximal degree in co-relation 1902. Up to 269 conditions per place. [2021-06-11 16:14:33,949 INFO L132 encePairwiseOnDemand]: 177/181 looper letters, 4 selfloop transitions, 3 changer transitions 2/51 dead transitions. [2021-06-11 16:14:33,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 381 flow [2021-06-11 16:14:33,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:14:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:14:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 729 transitions. [2021-06-11 16:14:33,951 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8055248618784531 [2021-06-11 16:14:33,952 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 729 transitions. [2021-06-11 16:14:33,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 729 transitions. [2021-06-11 16:14:33,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:33,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 729 transitions. [2021-06-11 16:14:33,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,955 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:33,955 INFO L185 Difference]: Start difference. First operand has 61 places, 49 transitions, 355 flow. Second operand 5 states and 729 transitions. [2021-06-11 16:14:33,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 381 flow [2021-06-11 16:14:33,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 51 transitions, 346 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-06-11 16:14:33,966 INFO L241 Difference]: Finished difference. Result has 65 places, 49 transitions, 333 flow [2021-06-11 16:14:33,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2021-06-11 16:14:33,966 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2021-06-11 16:14:33,966 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:33,967 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 49 transitions, 333 flow [2021-06-11 16:14:33,967 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 49 transitions, 333 flow [2021-06-11 16:14:33,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 49 transitions, 333 flow [2021-06-11 16:14:33,998 INFO L129 PetriNetUnfolder]: 94/309 cut-off events. [2021-06-11 16:14:33,998 INFO L130 PetriNetUnfolder]: For 765/792 co-relation queries the response was YES. [2021-06-11 16:14:33,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 309 events. 94/309 cut-off events. For 765/792 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2052 event pairs, 9 based on Foata normal form. 7/302 useless extension candidates. Maximal degree in co-relation 1084. Up to 73 conditions per place. [2021-06-11 16:14:34,001 INFO L151 LiptonReduction]: Number of co-enabled transitions 392 [2021-06-11 16:14:34,006 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:14:34,006 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:34,006 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-06-11 16:14:34,007 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 333 flow [2021-06-11 16:14:34,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,007 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:34,007 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:14:34,008 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 16:14:34,008 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash -266225227, now seen corresponding path program 2 times [2021-06-11 16:14:34,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:34,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827231248] [2021-06-11 16:14:34,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:34,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:34,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:34,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:34,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:34,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:34,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:14:34,060 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:14:34,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:34,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:34,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:34,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827231248] [2021-06-11 16:14:34,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:34,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:14:34,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465854588] [2021-06-11 16:14:34,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:14:34,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:34,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:14:34,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:14:34,070 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 181 [2021-06-11 16:14:34,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 333 flow. Second operand has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:34,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 181 [2021-06-11 16:14:34,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:34,153 INFO L129 PetriNetUnfolder]: 76/253 cut-off events. [2021-06-11 16:14:34,154 INFO L130 PetriNetUnfolder]: For 686/952 co-relation queries the response was YES. [2021-06-11 16:14:34,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 253 events. 76/253 cut-off events. For 686/952 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1598 event pairs, 5 based on Foata normal form. 151/388 useless extension candidates. Maximal degree in co-relation 997. Up to 65 conditions per place. [2021-06-11 16:14:34,156 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 2 selfloop transitions, 19 changer transitions 10/53 dead transitions. [2021-06-11 16:14:34,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 53 transitions, 411 flow [2021-06-11 16:14:34,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 16:14:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 16:14:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2021-06-11 16:14:34,159 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7894413750767342 [2021-06-11 16:14:34,159 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1286 transitions. [2021-06-11 16:14:34,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1286 transitions. [2021-06-11 16:14:34,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:34,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1286 transitions. [2021-06-11 16:14:34,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 142.88888888888889) internal successors, (1286), 9 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,165 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,166 INFO L185 Difference]: Start difference. First operand has 63 places, 49 transitions, 333 flow. Second operand 9 states and 1286 transitions. [2021-06-11 16:14:34,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 53 transitions, 411 flow [2021-06-11 16:14:34,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 53 transitions, 383 flow, removed 7 selfloop flow, removed 5 redundant places. [2021-06-11 16:14:34,170 INFO L241 Difference]: Finished difference. Result has 69 places, 43 transitions, 323 flow [2021-06-11 16:14:34,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=323, PETRI_PLACES=69, PETRI_TRANSITIONS=43} [2021-06-11 16:14:34,170 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2021-06-11 16:14:34,170 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:34,170 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 43 transitions, 323 flow [2021-06-11 16:14:34,171 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 43 transitions, 323 flow [2021-06-11 16:14:34,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 43 transitions, 323 flow [2021-06-11 16:14:34,182 INFO L129 PetriNetUnfolder]: 26/99 cut-off events. [2021-06-11 16:14:34,182 INFO L130 PetriNetUnfolder]: For 265/298 co-relation queries the response was YES. [2021-06-11 16:14:34,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 99 events. 26/99 cut-off events. For 265/298 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 426 event pairs, 0 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 382. Up to 26 conditions per place. [2021-06-11 16:14:34,183 INFO L151 LiptonReduction]: Number of co-enabled transitions 222 [2021-06-11 16:14:34,186 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:14:34,186 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:14:34,187 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-06-11 16:14:34,187 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 323 flow [2021-06-11 16:14:34,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,188 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:34,188 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-06-11 16:14:34,188 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 16:14:34,188 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:34,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:34,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2142340794, now seen corresponding path program 1 times [2021-06-11 16:14:34,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:34,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046219132] [2021-06-11 16:14:34,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:14:34,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:34,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:14:34,255 INFO L142 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size [2021-06-11 16:14:34,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 16:14:34,273 INFO L142 QuantifierPusher]: treesize reduction 37, result has 53.2 percent of original size [2021-06-11 16:14:34,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 16:14:34,307 INFO L142 QuantifierPusher]: treesize reduction 37, result has 55.4 percent of original size [2021-06-11 16:14:34,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 16:14:34,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:34,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 16:14:34,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:34,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 16:14:34,372 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-06-11 16:14:34,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 16:14:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:14:34,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046219132] [2021-06-11 16:14:34,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:14:34,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 16:14:34,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654165034] [2021-06-11 16:14:34,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 16:14:34,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:14:34,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 16:14:34,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 16:14:34,411 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 181 [2021-06-11 16:14:34,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 43 transitions, 323 flow. Second operand has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:14:34,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 181 [2021-06-11 16:14:34,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:14:34,524 INFO L129 PetriNetUnfolder]: 50/176 cut-off events. [2021-06-11 16:14:34,525 INFO L130 PetriNetUnfolder]: For 817/921 co-relation queries the response was YES. [2021-06-11 16:14:34,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 176 events. 50/176 cut-off events. For 817/921 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 981 event pairs, 0 based on Foata normal form. 25/190 useless extension candidates. Maximal degree in co-relation 743. Up to 60 conditions per place. [2021-06-11 16:14:34,526 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 12 selfloop transitions, 6 changer transitions 8/51 dead transitions. [2021-06-11 16:14:34,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 51 transitions, 433 flow [2021-06-11 16:14:34,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 16:14:34,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 16:14:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2021-06-11 16:14:34,529 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6915285451197053 [2021-06-11 16:14:34,529 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2021-06-11 16:14:34,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2021-06-11 16:14:34,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:14:34,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2021-06-11 16:14:34,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,533 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,533 INFO L185 Difference]: Start difference. First operand has 67 places, 43 transitions, 323 flow. Second operand 6 states and 751 transitions. [2021-06-11 16:14:34,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 51 transitions, 433 flow [2021-06-11 16:14:34,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 337 flow, removed 25 selfloop flow, removed 15 redundant places. [2021-06-11 16:14:34,537 INFO L241 Difference]: Finished difference. Result has 59 places, 40 transitions, 242 flow [2021-06-11 16:14:34,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2021-06-11 16:14:34,537 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2021-06-11 16:14:34,537 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:34,538 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 40 transitions, 242 flow [2021-06-11 16:14:34,538 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 40 transitions, 242 flow [2021-06-11 16:14:34,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 40 transitions, 242 flow [2021-06-11 16:14:34,550 INFO L129 PetriNetUnfolder]: 23/106 cut-off events. [2021-06-11 16:14:34,551 INFO L130 PetriNetUnfolder]: For 125/127 co-relation queries the response was YES. [2021-06-11 16:14:34,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 106 events. 23/106 cut-off events. For 125/127 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 497 event pairs, 1 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 337. Up to 29 conditions per place. [2021-06-11 16:14:34,552 INFO L151 LiptonReduction]: Number of co-enabled transitions 128 [2021-06-11 16:14:34,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:34,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:34,677 INFO L163 LiptonReduction]: Checked pairs total: 5 [2021-06-11 16:14:34,677 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 16:14:34,677 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 140 [2021-06-11 16:14:34,678 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 240 flow [2021-06-11 16:14:34,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:14:34,679 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:14:34,679 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-06-11 16:14:34,679 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 16:14:34,679 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 16:14:34,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:14:34,679 INFO L82 PathProgramCache]: Analyzing trace with hash -597410402, now seen corresponding path program 2 times [2021-06-11 16:14:34,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:14:34,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441509543] [2021-06-11 16:14:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:14:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:14:34,769 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:14:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:14:34,804 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:14:34,838 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 16:14:34,839 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 16:14:34,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 16:14:34,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 04:14:34 BasicIcfg [2021-06-11 16:14:34,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 16:14:34,908 INFO L168 Benchmark]: Toolchain (without parser) took 22252.54 ms. Allocated memory was 362.8 MB in the beginning and 696.3 MB in the end (delta: 333.4 MB). Free memory was 325.3 MB in the beginning and 631.9 MB in the end (delta: -306.7 MB). Peak memory consumption was 28.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:14:34,908 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 362.8 MB. Free memory is still 343.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:14:34,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 493.92 ms. Allocated memory is still 362.8 MB. Free memory was 325.1 MB in the beginning and 321.5 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:14:34,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.93 ms. Allocated memory is still 362.8 MB. Free memory was 321.5 MB in the beginning and 318.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:14:34,909 INFO L168 Benchmark]: Boogie Preprocessor took 40.24 ms. Allocated memory is still 362.8 MB. Free memory was 318.3 MB in the beginning and 316.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:14:34,909 INFO L168 Benchmark]: RCFGBuilder took 1639.75 ms. Allocated memory is still 362.8 MB. Free memory was 316.2 MB in the beginning and 263.3 MB in the end (delta: 52.9 MB). Peak memory consumption was 148.3 MB. Max. memory is 16.0 GB. [2021-06-11 16:14:34,909 INFO L168 Benchmark]: TraceAbstraction took 20025.53 ms. Allocated memory was 362.8 MB in the beginning and 696.3 MB in the end (delta: 333.4 MB). Free memory was 263.3 MB in the beginning and 631.9 MB in the end (delta: -368.6 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:14:34,910 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.14 ms. Allocated memory is still 362.8 MB. Free memory is still 343.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 493.92 ms. Allocated memory is still 362.8 MB. Free memory was 325.1 MB in the beginning and 321.5 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.93 ms. Allocated memory is still 362.8 MB. Free memory was 321.5 MB in the beginning and 318.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.24 ms. Allocated memory is still 362.8 MB. Free memory was 318.3 MB in the beginning and 316.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1639.75 ms. Allocated memory is still 362.8 MB. Free memory was 316.2 MB in the beginning and 263.3 MB in the end (delta: 52.9 MB). Peak memory consumption was 148.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20025.53 ms. Allocated memory was 362.8 MB in the beginning and 696.3 MB in the end (delta: 333.4 MB). Free memory was 263.3 MB in the beginning and 631.9 MB in the end (delta: -368.6 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15853.0ms, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 28 TransitionsAfterwards, 1602 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 86 TotalNumberOfCompositions, 4098 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2109, positive: 1977, positive conditional: 1977, positive unconditional: 0, negative: 132, negative conditional: 132, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2109, positive: 1977, positive conditional: 0, positive unconditional: 1977, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2109, positive: 1977, positive conditional: 0, positive unconditional: 1977, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1382, positive: 1333, positive conditional: 0, positive unconditional: 1333, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1382, positive: 1302, positive conditional: 0, positive unconditional: 1302, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 762, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 687, negative conditional: 0, negative unconditional: 687, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2109, positive: 644, positive conditional: 0, positive unconditional: 644, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 1382, unknown conditional: 0, unknown unconditional: 1382] , Statistics on independence cache: Total cache size (in pairs): 1382, Positive cache size: 1333, Positive conditional cache size: 0, Positive unconditional cache size: 1333, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 137.8ms, 33 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 234 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, positive: 75, positive conditional: 75, 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: 93, positive: 75, positive conditional: 2, positive unconditional: 73, negative: 18, negative conditional: 4, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 75, positive conditional: 2, positive unconditional: 73, negative: 18, negative conditional: 4, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 7, negative conditional: 4, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 4, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 130, negative conditional: 61, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 17, unknown conditional: 6, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1399, Positive cache size: 1343, Positive conditional cache size: 2, Positive unconditional cache size: 1341, Negative cache size: 56, Negative conditional cache size: 4, Negative unconditional cache size: 52, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 221.0ms, 32 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 209 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 215, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 215, negative conditional: 0, negative unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 1413, Positive cache size: 1350, Positive conditional cache size: 2, Positive unconditional cache size: 1348, Negative cache size: 63, Negative conditional cache size: 4, Negative unconditional cache size: 59, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 146.4ms, 33 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 161 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 62, positive conditional: 62, 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: 75, positive: 62, positive conditional: 0, positive unconditional: 62, 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: 75, positive: 62, positive conditional: 0, positive unconditional: 62, 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: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 135, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 135, negative conditional: 0, negative unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1420, Positive cache size: 1353, Positive conditional cache size: 2, Positive unconditional cache size: 1351, Negative cache size: 67, Negative conditional cache size: 4, Negative unconditional cache size: 63, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.4ms, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 74 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, positive: 20, positive conditional: 2, positive unconditional: 18, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, positive: 20, positive conditional: 2, positive unconditional: 18, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1423, Positive cache size: 1355, Positive conditional cache size: 4, Positive unconditional cache size: 1351, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 408.8ms, 43 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, positive: 24, positive conditional: 16, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 16, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, 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: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 381, positive: 381, positive conditional: 381, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1439, Positive cache size: 1371, Positive conditional cache size: 20, Positive unconditional cache size: 1351, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, positive: 18, positive conditional: 10, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 10, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, positive: 27, positive conditional: 27, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, positive: 16, positive conditional: 8, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1441, Positive cache size: 1373, Positive conditional cache size: 22, Positive unconditional cache size: 1351, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.4ms, 48 PlacesBefore, 48 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 7, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 5, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 15, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1449, Positive cache size: 1381, Positive conditional cache size: 27, Positive unconditional cache size: 1354, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.2ms, 53 PlacesBefore, 53 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1449, Positive cache size: 1381, Positive conditional cache size: 27, Positive unconditional cache size: 1354, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.6ms, 61 PlacesBefore, 61 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1449, Positive cache size: 1381, Positive conditional cache size: 27, Positive unconditional cache size: 1354, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.5ms, 65 PlacesBefore, 63 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1449, Positive cache size: 1381, Positive conditional cache size: 27, Positive unconditional cache size: 1354, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.8ms, 69 PlacesBefore, 67 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1449, Positive cache size: 1381, Positive conditional cache size: 27, Positive unconditional cache size: 1354, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 139.5ms, 59 PlacesBefore, 57 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1450, Positive cache size: 1382, Positive conditional cache size: 28, Positive unconditional cache size: 1354, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2180; [L814] FCALL, FORK 0 pthread_create(&t2180, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2181; [L816] FCALL, FORK 0 pthread_create(&t2181, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L817] 0 pthread_t t2182; [L818] FCALL, FORK 0 pthread_create(&t2182, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19870.4ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1102.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15950.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 51 SDtfs, 19 SDslu, 20 SDs, 0 SdLazy, 254 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 300.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 335.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=355occurred in iteration=9, InterpolantAutomatonStates: 58, 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: 44.3ms SsaConstructionTime, 386.4ms SatisfiabilityAnalysisTime, 801.8ms InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 1189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...