/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 21:31:25,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 21:31:25,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 21:31:25,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 21:31:25,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 21:31:25,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 21:31:25,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 21:31:25,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 21:31:25,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 21:31:25,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 21:31:25,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 21:31:25,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 21:31:25,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 21:31:25,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 21:31:25,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 21:31:25,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 21:31:25,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 21:31:25,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 21:31:25,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 21:31:25,973 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 21:31:25,974 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 21:31:25,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 21:31:25,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 21:31:25,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 21:31:25,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 21:31:25,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 21:31:25,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 21:31:25,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 21:31:25,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 21:31:25,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 21:31:25,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 21:31:25,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 21:31:25,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 21:31:25,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 21:31:25,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 21:31:25,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 21:31:25,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 21:31:25,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 21:31:25,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 21:31:25,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 21:31:25,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 21:31:25,992 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-SemanticLbe.epf [2021-06-10 21:31:26,017 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 21:31:26,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 21:31:26,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 21:31:26,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 21:31:26,019 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 21:31:26,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 21:31:26,019 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 21:31:26,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 21:31:26,020 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 21:31:26,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 21:31:26,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 21:31:26,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 21:31:26,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 21:31:26,021 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 21:31:26,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 21:31:26,021 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 21:31:26,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 21:31:26,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 21:31:26,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 21:31:26,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 21:31:26,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 21:31:26,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 21:31:26,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 21:31:26,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 21:31:26,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 21:31:26,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 21:31:26,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 21:31:26,022 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 21:31:26,022 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-10 21:31:26,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 21:31:26,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 21:31:26,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 21:31:26,296 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 21:31:26,297 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 21:31:26,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2021-06-10 21:31:26,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1a105a20/0ed218104efc4eafbb2be6396af629fb/FLAG52c3fe6f2 [2021-06-10 21:31:26,759 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 21:31:26,760 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.opt.i [2021-06-10 21:31:26,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1a105a20/0ed218104efc4eafbb2be6396af629fb/FLAG52c3fe6f2 [2021-06-10 21:31:26,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1a105a20/0ed218104efc4eafbb2be6396af629fb [2021-06-10 21:31:26,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 21:31:26,783 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 21:31:26,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 21:31:26,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 21:31:26,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 21:31:26,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3735c472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:26, skipping insertion in model container [2021-06-10 21:31:26,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 09:31:26" (1/1) ... [2021-06-10 21:31:26,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 21:31:26,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 21:31:26,952 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/safe031_pso.opt.i[949,962] [2021-06-10 21:31:27,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 21:31:27,119 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 21:31:27,126 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/safe031_pso.opt.i[949,962] [2021-06-10 21:31:27,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 21:31:27,203 INFO L208 MainTranslator]: Completed translation [2021-06-10 21:31:27,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27 WrapperNode [2021-06-10 21:31:27,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 21:31:27,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 21:31:27,205 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 21:31:27,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 21:31:27,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (1/1) ... [2021-06-10 21:31:27,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (1/1) ... [2021-06-10 21:31:27,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 21:31:27,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 21:31:27,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 21:31:27,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 21:31:27,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (1/1) ... [2021-06-10 21:31:27,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (1/1) ... [2021-06-10 21:31:27,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (1/1) ... [2021-06-10 21:31:27,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (1/1) ... [2021-06-10 21:31:27,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (1/1) ... [2021-06-10 21:31:27,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (1/1) ... [2021-06-10 21:31:27,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (1/1) ... [2021-06-10 21:31:27,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 21:31:27,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 21:31:27,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 21:31:27,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 21:31:27,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (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-10 21:31:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 21:31:27,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 21:31:27,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 21:31:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 21:31:27,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 21:31:27,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 21:31:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 21:31:27,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 21:31:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 21:31:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 21:31:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 21:31:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 21:31:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 21:31:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 21:31:27,334 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 21:31:28,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 21:31:28,552 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 21:31:28,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 09:31:28 BoogieIcfgContainer [2021-06-10 21:31:28,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 21:31:28,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 21:31:28,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 21:31:28,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 21:31:28,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 09:31:26" (1/3) ... [2021-06-10 21:31:28,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cab390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 09:31:28, skipping insertion in model container [2021-06-10 21:31:28,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 09:31:27" (2/3) ... [2021-06-10 21:31:28,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46cab390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 09:31:28, skipping insertion in model container [2021-06-10 21:31:28,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 09:31:28" (3/3) ... [2021-06-10 21:31:28,560 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt.i [2021-06-10 21:31:28,565 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 21:31:28,567 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 21:31:28,568 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 21:31:28,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,593 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,593 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,593 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,593 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,594 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,595 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,599 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,599 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,599 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,599 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,599 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,600 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,602 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,604 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,604 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,605 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,606 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 21:31:28,613 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 21:31:28,626 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-10 21:31:28,649 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 21:31:28,650 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 21:31:28,651 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 21:31:28,651 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 21:31:28,651 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 21:31:28,655 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 21:31:28,655 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 21:31:28,655 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 21:31:28,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-06-10 21:31:28,696 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-06-10 21:31:28,697 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:31:28,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-10 21:31:28,706 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-06-10 21:31:28,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-06-10 21:31:28,711 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-10 21:31:28,719 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-06-10 21:31:28,722 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-06-10 21:31:28,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-06-10 21:31:28,747 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-06-10 21:31:28,747 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:31:28,748 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-10 21:31:28,751 INFO L151 LiptonReduction]: Number of co-enabled transitions 1578 [2021-06-10 21:31:28,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:28,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:28,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:28,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:28,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:28,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:28,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:28,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:28,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,090 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-10 21:31:29,090 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:29,110 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:29,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:29,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:29,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,776 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:29,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:29,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:29,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,902 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-10 21:31:29,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:29,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:29,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,297 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:30,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:30,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:30,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:30,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:30,595 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-10 21:31:30,980 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-10 21:31:31,100 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-10 21:31:31,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,133 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-10 21:31:31,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,138 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-10 21:31:31,138 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,140 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,142 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-10 21:31:31,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,144 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-10 21:31:31,144 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-10 21:31:31,144 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,146 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,147 INFO L147 QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50 [2021-06-10 21:31:31,148 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-10 21:31:31,148 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,149 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,159 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-10 21:31:31,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:31,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:31,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,547 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:31,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:31,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,595 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-10 21:31:31,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,810 INFO L142 QuantifierPusher]: treesize reduction 84, result has 91.1 percent of original size [2021-06-10 21:31:31,813 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,814 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,815 INFO L147 QuantifierPusher]: treesize reduction 22, result has 4.3 percent of original size 1 [2021-06-10 21:31:31,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-10 21:31:31,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:31,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,820 INFO L142 QuantifierPusher]: treesize reduction 24, result has 78.4 percent of original size [2021-06-10 21:31:31,821 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-10 21:31:31,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,828 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-10 21:31:31,829 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-10 21:31:31,833 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-10 21:31:31,836 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-10 21:31:31,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,840 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-10 21:31:31,841 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-10 21:31:31,841 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,842 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,843 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-10 21:31:31,843 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,844 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,845 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-10 21:31:31,845 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,846 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,850 INFO L147 QuantifierPusher]: treesize reduction 141, result has 54.4 percent of original size 168 [2021-06-10 21:31:31,851 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:31,853 INFO L142 QuantifierPusher]: treesize reduction 141, result has 65.9 percent of original size [2021-06-10 21:31:31,853 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 3, 2, 1] term [2021-06-10 21:31:31,853 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,855 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,855 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 2, 3, 2, 1] term [2021-06-10 21:31:31,855 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,856 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,857 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 3, 2, 1] term [2021-06-10 21:31:31,857 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,858 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,861 INFO L147 QuantifierPusher]: treesize reduction 513, result has 19.5 percent of original size 124 [2021-06-10 21:31:31,861 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-10 21:31:31,861 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,862 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,863 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-10 21:31:31,863 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,864 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,865 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-10 21:31:31,865 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-10 21:31:31,866 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:31,899 INFO L147 QuantifierPusher]: treesize reduction 1984, result has 7.2 percent of original size 153 [2021-06-10 21:31:32,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,014 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,024 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-10 21:31:32,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:32,025 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,026 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-10 21:31:32,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-10 21:31:32,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-10 21:31:32,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-10 21:31:32,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,171 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:32,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:32,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:32,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:32,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:32,618 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-10 21:31:32,974 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-10 21:31:33,125 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-10 21:31:33,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,145 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-10 21:31:33,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:33,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:33,158 INFO L163 LiptonReduction]: Checked pairs total: 4059 [2021-06-10 21:31:33,158 INFO L165 LiptonReduction]: Total number of compositions: 86 [2021-06-10 21:31:33,160 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4450 [2021-06-10 21:31:33,180 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-06-10 21:31:33,180 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:31:33,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:33,181 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:33,181 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:33,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 952872646, now seen corresponding path program 1 times [2021-06-10 21:31:33,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:33,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32219881] [2021-06-10 21:31:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:33,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 21:31:33,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32219881] [2021-06-10 21:31:33,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:33,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-10 21:31:33,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288051754] [2021-06-10 21:31:33,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 21:31:33,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:33,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 21:31:33,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 21:31:33,370 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 182 [2021-06-10 21:31:33,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 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-10 21:31:33,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:33,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 182 [2021-06-10 21:31:33,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:33,425 INFO L129 PetriNetUnfolder]: 16/64 cut-off events. [2021-06-10 21:31:33,425 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:31:33,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 64 events. 16/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 232 event pairs, 2 based on Foata normal form. 12/73 useless extension candidates. Maximal degree in co-relation 99. Up to 27 conditions per place. [2021-06-10 21:31:33,427 INFO L132 encePairwiseOnDemand]: 177/182 looper letters, 7 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-06-10 21:31:33,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 79 flow [2021-06-10 21:31:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 21:31:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 21:31:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 464 transitions. [2021-06-10 21:31:33,442 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8498168498168498 [2021-06-10 21:31:33,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 464 transitions. [2021-06-10 21:31:33,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 464 transitions. [2021-06-10 21:31:33,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:33,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 464 transitions. [2021-06-10 21:31:33,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 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-10 21:31:33,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 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-10 21:31:33,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 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-10 21:31:33,459 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 464 transitions. [2021-06-10 21:31:33,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 79 flow [2021-06-10 21:31:33,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 76 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-10 21:31:33,462 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2021-06-10 21:31:33,463 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-06-10 21:31:33,464 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-10 21:31:33,464 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-06-10 21:31:33,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 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-10 21:31:33,464 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:33,465 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:33,465 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-10 21:31:33,465 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:33,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:33,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1592390053, now seen corresponding path program 1 times [2021-06-10 21:31:33,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:33,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118855428] [2021-06-10 21:31:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:33,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:33,579 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:33,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:33,590 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-10 21:31:33,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118855428] [2021-06-10 21:31:33,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:33,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 21:31:33,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72534228] [2021-06-10 21:31:33,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:31:33,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:33,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:31:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:31:33,594 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-10 21:31:33,595 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:33,595 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:33,595 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-10 21:31:33,595 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:33,641 INFO L129 PetriNetUnfolder]: 12/66 cut-off events. [2021-06-10 21:31:33,641 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 21:31:33,642 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 66 events. 12/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 217 event pairs, 3 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 101. Up to 20 conditions per place. [2021-06-10 21:31:33,642 INFO L132 encePairwiseOnDemand]: 177/182 looper letters, 4 selfloop transitions, 3 changer transitions 8/32 dead transitions. [2021-06-10 21:31:33,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 104 flow [2021-06-10 21:31:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:31:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:31:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 732 transitions. [2021-06-10 21:31:33,644 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8043956043956044 [2021-06-10 21:31:33,644 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 732 transitions. [2021-06-10 21:31:33,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 732 transitions. [2021-06-10 21:31:33,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:33,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 732 transitions. [2021-06-10 21:31:33,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 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-10 21:31:33,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 21:31:33,649 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 21:31:33,649 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 732 transitions. [2021-06-10 21:31:33,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 104 flow [2021-06-10 21:31:33,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 21:31:33,650 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 77 flow [2021-06-10 21:31:33,650 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2021-06-10 21:31:33,650 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2021-06-10 21:31:33,651 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 77 flow [2021-06-10 21:31:33,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:33,651 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:33,651 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:33,651 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-10 21:31:33,651 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1129374410, now seen corresponding path program 1 times [2021-06-10 21:31:33,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:33,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814170065] [2021-06-10 21:31:33,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:33,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:33,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:31:33,758 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:33,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:33,772 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-10 21:31:33,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814170065] [2021-06-10 21:31:33,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:33,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:31:33,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589695397] [2021-06-10 21:31:33,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:31:33,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:33,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:31:33,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:31:33,776 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 182 [2021-06-10 21:31:33,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 77 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-10 21:31:33,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:33,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 182 [2021-06-10 21:31:33,777 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:33,863 INFO L129 PetriNetUnfolder]: 87/192 cut-off events. [2021-06-10 21:31:33,863 INFO L130 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2021-06-10 21:31:33,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 192 events. 87/192 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 797 event pairs, 51 based on Foata normal form. 10/197 useless extension candidates. Maximal degree in co-relation 446. Up to 117 conditions per place. [2021-06-10 21:31:33,866 INFO L132 encePairwiseOnDemand]: 177/182 looper letters, 8 selfloop transitions, 3 changer transitions 7/34 dead transitions. [2021-06-10 21:31:33,866 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 135 flow [2021-06-10 21:31:33,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:31:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:31:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2021-06-10 21:31:33,868 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7252747252747253 [2021-06-10 21:31:33,868 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2021-06-10 21:31:33,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2021-06-10 21:31:33,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:33,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2021-06-10 21:31:33,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 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-10 21:31:33,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 21:31:33,872 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 21:31:33,872 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 77 flow. Second operand 5 states and 660 transitions. [2021-06-10 21:31:33,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 135 flow [2021-06-10 21:31:33,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 130 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 21:31:33,875 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 99 flow [2021-06-10 21:31:33,875 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2021-06-10 21:31:33,875 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2021-06-10 21:31:33,875 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 99 flow [2021-06-10 21:31:33,875 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-10 21:31:33,875 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:33,876 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:33,876 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-10 21:31:33,876 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash 17844465, now seen corresponding path program 1 times [2021-06-10 21:31:33,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:33,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307916973] [2021-06-10 21:31:33,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:33,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:33,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:33,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:33,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:33,979 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:33,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:33,991 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-10 21:31:33,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307916973] [2021-06-10 21:31:33,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:33,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:33,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267137759] [2021-06-10 21:31:33,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:31:33,992 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:33,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:31:33,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:31:33,993 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 182 [2021-06-10 21:31:33,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 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-10 21:31:33,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:33,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 182 [2021-06-10 21:31:33,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,087 INFO L129 PetriNetUnfolder]: 71/180 cut-off events. [2021-06-10 21:31:34,087 INFO L130 PetriNetUnfolder]: For 237/237 co-relation queries the response was YES. [2021-06-10 21:31:34,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 180 events. 71/180 cut-off events. For 237/237 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 799 event pairs, 44 based on Foata normal form. 13/183 useless extension candidates. Maximal degree in co-relation 471. Up to 99 conditions per place. [2021-06-10 21:31:34,089 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 9 selfloop transitions, 5 changer transitions 6/36 dead transitions. [2021-06-10 21:31:34,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 175 flow [2021-06-10 21:31:34,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:31:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:31:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 766 transitions. [2021-06-10 21:31:34,091 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7014652014652014 [2021-06-10 21:31:34,091 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 766 transitions. [2021-06-10 21:31:34,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 766 transitions. [2021-06-10 21:31:34,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:34,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 766 transitions. [2021-06-10 21:31:34,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 0 states have call successors, (0), 0 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-10 21:31:34,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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-10 21:31:34,095 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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-10 21:31:34,095 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 99 flow. Second operand 6 states and 766 transitions. [2021-06-10 21:31:34,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 175 flow [2021-06-10 21:31:34,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 170 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-10 21:31:34,097 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 129 flow [2021-06-10 21:31:34,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-06-10 21:31:34,097 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2021-06-10 21:31:34,097 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 129 flow [2021-06-10 21:31:34,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 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-10 21:31:34,097 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:34,097 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:34,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-10 21:31:34,098 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:34,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:34,098 INFO L82 PathProgramCache]: Analyzing trace with hash 47248330, now seen corresponding path program 1 times [2021-06-10 21:31:34,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:34,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235933238] [2021-06-10 21:31:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:34,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:34,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:34,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-10 21:31:34,189 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:34,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:34,199 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-10 21:31:34,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235933238] [2021-06-10 21:31:34,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:34,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:34,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865247354] [2021-06-10 21:31:34,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:31:34,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:34,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:31:34,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:31:34,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 182 [2021-06-10 21:31:34,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 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-10 21:31:34,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:34,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 182 [2021-06-10 21:31:34,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,273 INFO L129 PetriNetUnfolder]: 65/151 cut-off events. [2021-06-10 21:31:34,273 INFO L130 PetriNetUnfolder]: For 347/347 co-relation queries the response was YES. [2021-06-10 21:31:34,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 151 events. 65/151 cut-off events. For 347/347 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 585 event pairs, 33 based on Foata normal form. 8/150 useless extension candidates. Maximal degree in co-relation 498. Up to 86 conditions per place. [2021-06-10 21:31:34,274 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 10 selfloop transitions, 7 changer transitions 6/39 dead transitions. [2021-06-10 21:31:34,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 221 flow [2021-06-10 21:31:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:31:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:31:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 814 transitions. [2021-06-10 21:31:34,276 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7454212454212454 [2021-06-10 21:31:34,276 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 814 transitions. [2021-06-10 21:31:34,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 814 transitions. [2021-06-10 21:31:34,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:34,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 814 transitions. [2021-06-10 21:31:34,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 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-10 21:31:34,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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-10 21:31:34,280 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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-10 21:31:34,280 INFO L185 Difference]: Start difference. First operand has 43 places, 28 transitions, 129 flow. Second operand 6 states and 814 transitions. [2021-06-10 21:31:34,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 221 flow [2021-06-10 21:31:34,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 202 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-06-10 21:31:34,282 INFO L241 Difference]: Finished difference. Result has 47 places, 31 transitions, 158 flow [2021-06-10 21:31:34,282 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2021-06-10 21:31:34,282 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2021-06-10 21:31:34,282 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 158 flow [2021-06-10 21:31:34,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 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-10 21:31:34,282 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:34,282 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:34,282 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-10 21:31:34,282 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:34,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:34,283 INFO L82 PathProgramCache]: Analyzing trace with hash -376830399, now seen corresponding path program 1 times [2021-06-10 21:31:34,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:34,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662705065] [2021-06-10 21:31:34,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:34,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:34,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:34,329 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:34,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:34,338 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-10 21:31:34,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662705065] [2021-06-10 21:31:34,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:34,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:31:34,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164416852] [2021-06-10 21:31:34,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:31:34,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:34,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:31:34,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:31:34,340 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-10 21:31:34,341 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-10 21:31:34,341 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:34,341 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-10 21:31:34,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,376 INFO L129 PetriNetUnfolder]: 26/130 cut-off events. [2021-06-10 21:31:34,376 INFO L130 PetriNetUnfolder]: For 581/606 co-relation queries the response was YES. [2021-06-10 21:31:34,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 130 events. 26/130 cut-off events. For 581/606 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 665 event pairs, 11 based on Foata normal form. 13/137 useless extension candidates. Maximal degree in co-relation 434. Up to 39 conditions per place. [2021-06-10 21:31:34,377 INFO L132 encePairwiseOnDemand]: 178/182 looper letters, 5 selfloop transitions, 3 changer transitions 2/34 dead transitions. [2021-06-10 21:31:34,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 34 transitions, 208 flow [2021-06-10 21:31:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:31:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:31:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2021-06-10 21:31:34,379 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7978021978021979 [2021-06-10 21:31:34,379 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2021-06-10 21:31:34,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2021-06-10 21:31:34,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:34,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2021-06-10 21:31:34,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 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-10 21:31:34,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 21:31:34,382 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 21:31:34,382 INFO L185 Difference]: Start difference. First operand has 47 places, 31 transitions, 158 flow. Second operand 5 states and 726 transitions. [2021-06-10 21:31:34,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 34 transitions, 208 flow [2021-06-10 21:31:34,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 184 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-06-10 21:31:34,384 INFO L241 Difference]: Finished difference. Result has 48 places, 31 transitions, 157 flow [2021-06-10 21:31:34,384 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2021-06-10 21:31:34,384 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2021-06-10 21:31:34,384 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 157 flow [2021-06-10 21:31:34,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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-10 21:31:34,385 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:34,385 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:34,385 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-10 21:31:34,385 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:34,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -210767369, now seen corresponding path program 1 times [2021-06-10 21:31:34,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:34,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342691453] [2021-06-10 21:31:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:34,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:31:34,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:31:34,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:34,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:34,426 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:34,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:34,437 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-10 21:31:34,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342691453] [2021-06-10 21:31:34,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:34,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:34,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378811226] [2021-06-10 21:31:34,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:31:34,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:34,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:31:34,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:31:34,439 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 182 [2021-06-10 21:31:34,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 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-10 21:31:34,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:34,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 182 [2021-06-10 21:31:34,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,533 INFO L129 PetriNetUnfolder]: 50/155 cut-off events. [2021-06-10 21:31:34,533 INFO L130 PetriNetUnfolder]: For 509/540 co-relation queries the response was YES. [2021-06-10 21:31:34,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 155 events. 50/155 cut-off events. For 509/540 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 684 event pairs, 13 based on Foata normal form. 14/164 useless extension candidates. Maximal degree in co-relation 537. Up to 83 conditions per place. [2021-06-10 21:31:34,534 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 10 selfloop transitions, 10 changer transitions 3/39 dead transitions. [2021-06-10 21:31:34,534 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 39 transitions, 249 flow [2021-06-10 21:31:34,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-10 21:31:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-10 21:31:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 789 transitions. [2021-06-10 21:31:34,536 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7225274725274725 [2021-06-10 21:31:34,536 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 789 transitions. [2021-06-10 21:31:34,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 789 transitions. [2021-06-10 21:31:34,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:34,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 789 transitions. [2021-06-10 21:31:34,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.5) internal successors, (789), 6 states have internal predecessors, (789), 0 states have call successors, (0), 0 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-10 21:31:34,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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-10 21:31:34,539 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 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-10 21:31:34,540 INFO L185 Difference]: Start difference. First operand has 48 places, 31 transitions, 157 flow. Second operand 6 states and 789 transitions. [2021-06-10 21:31:34,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 39 transitions, 249 flow [2021-06-10 21:31:34,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 240 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-06-10 21:31:34,541 INFO L241 Difference]: Finished difference. Result has 50 places, 34 transitions, 196 flow [2021-06-10 21:31:34,542 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2021-06-10 21:31:34,542 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2021-06-10 21:31:34,542 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 196 flow [2021-06-10 21:31:34,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 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-10 21:31:34,542 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:34,542 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:34,542 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-10 21:31:34,542 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:34,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1111403259, now seen corresponding path program 2 times [2021-06-10 21:31:34,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:34,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187435126] [2021-06-10 21:31:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:34,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:31:34,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:34,605 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-10 21:31:34,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-10 21:31:34,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:34,616 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:34,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:34,627 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-10 21:31:34,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187435126] [2021-06-10 21:31:34,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:34,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:34,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635996322] [2021-06-10 21:31:34,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:31:34,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:31:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:31:34,629 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 182 [2021-06-10 21:31:34,630 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 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-10 21:31:34,630 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:34,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 182 [2021-06-10 21:31:34,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,719 INFO L129 PetriNetUnfolder]: 52/172 cut-off events. [2021-06-10 21:31:34,720 INFO L130 PetriNetUnfolder]: For 576/600 co-relation queries the response was YES. [2021-06-10 21:31:34,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 172 events. 52/172 cut-off events. For 576/600 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 860 event pairs, 7 based on Foata normal form. 17/186 useless extension candidates. Maximal degree in co-relation 638. Up to 85 conditions per place. [2021-06-10 21:31:34,721 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 11 selfloop transitions, 11 changer transitions 5/43 dead transitions. [2021-06-10 21:31:34,721 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 43 transitions, 320 flow [2021-06-10 21:31:34,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:31:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:31:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2021-06-10 21:31:34,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7221350078492935 [2021-06-10 21:31:34,723 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2021-06-10 21:31:34,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2021-06-10 21:31:34,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:34,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2021-06-10 21:31:34,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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-10 21:31:34,726 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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-10 21:31:34,726 INFO L185 Difference]: Start difference. First operand has 50 places, 34 transitions, 196 flow. Second operand 7 states and 920 transitions. [2021-06-10 21:31:34,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 43 transitions, 320 flow [2021-06-10 21:31:34,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 294 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-06-10 21:31:34,728 INFO L241 Difference]: Finished difference. Result has 54 places, 36 transitions, 225 flow [2021-06-10 21:31:34,729 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2021-06-10 21:31:34,729 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2021-06-10 21:31:34,729 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 225 flow [2021-06-10 21:31:34,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 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-10 21:31:34,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:34,729 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:34,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-10 21:31:34,729 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:34,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash 152071491, now seen corresponding path program 3 times [2021-06-10 21:31:34,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:34,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225616017] [2021-06-10 21:31:34,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:34,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 21:31:34,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-10 21:31:34,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 21:31:34,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 21:31:34,785 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:34,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:34,797 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-10 21:31:34,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225616017] [2021-06-10 21:31:34,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:34,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:31:34,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767283311] [2021-06-10 21:31:34,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 21:31:34,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:34,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 21:31:34,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-10 21:31:34,799 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 182 [2021-06-10 21:31:34,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 225 flow. Second operand has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 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-10 21:31:34,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:34,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 182 [2021-06-10 21:31:34,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,900 INFO L129 PetriNetUnfolder]: 41/160 cut-off events. [2021-06-10 21:31:34,900 INFO L130 PetriNetUnfolder]: For 662/665 co-relation queries the response was YES. [2021-06-10 21:31:34,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 160 events. 41/160 cut-off events. For 662/665 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 796 event pairs, 4 based on Foata normal form. 12/169 useless extension candidates. Maximal degree in co-relation 637. Up to 61 conditions per place. [2021-06-10 21:31:34,901 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 12 selfloop transitions, 15 changer transitions 5/48 dead transitions. [2021-06-10 21:31:34,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 409 flow [2021-06-10 21:31:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-10 21:31:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-10 21:31:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1042 transitions. [2021-06-10 21:31:34,904 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7156593406593407 [2021-06-10 21:31:34,904 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1042 transitions. [2021-06-10 21:31:34,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1042 transitions. [2021-06-10 21:31:34,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:34,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1042 transitions. [2021-06-10 21:31:34,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.25) internal successors, (1042), 8 states have internal predecessors, (1042), 0 states have call successors, (0), 0 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-10 21:31:34,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 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-10 21:31:34,907 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 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-10 21:31:34,907 INFO L185 Difference]: Start difference. First operand has 54 places, 36 transitions, 225 flow. Second operand 8 states and 1042 transitions. [2021-06-10 21:31:34,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 409 flow [2021-06-10 21:31:34,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 382 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-06-10 21:31:34,910 INFO L241 Difference]: Finished difference. Result has 58 places, 40 transitions, 290 flow [2021-06-10 21:31:34,910 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=290, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2021-06-10 21:31:34,910 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2021-06-10 21:31:34,910 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 290 flow [2021-06-10 21:31:34,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 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-10 21:31:34,911 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:34,911 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:34,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-10 21:31:34,911 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1955478022, now seen corresponding path program 1 times [2021-06-10 21:31:34,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:34,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598699647] [2021-06-10 21:31:34,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:34,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:34,942 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 21:31:34,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:34,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:34,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:34,948 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-10 21:31:34,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598699647] [2021-06-10 21:31:34,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:34,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-10 21:31:34,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416475831] [2021-06-10 21:31:34,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-10 21:31:34,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-10 21:31:34,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-10 21:31:34,949 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 182 [2021-06-10 21:31:34,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:34,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:34,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 182 [2021-06-10 21:31:34,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:34,997 INFO L129 PetriNetUnfolder]: 178/386 cut-off events. [2021-06-10 21:31:34,997 INFO L130 PetriNetUnfolder]: For 1176/1267 co-relation queries the response was YES. [2021-06-10 21:31:34,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 386 events. 178/386 cut-off events. For 1176/1267 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2290 event pairs, 51 based on Foata normal form. 56/374 useless extension candidates. Maximal degree in co-relation 1302. Up to 163 conditions per place. [2021-06-10 21:31:35,000 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 10 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2021-06-10 21:31:35,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 352 flow [2021-06-10 21:31:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:31:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:31:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 730 transitions. [2021-06-10 21:31:35,002 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8021978021978022 [2021-06-10 21:31:35,002 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 730 transitions. [2021-06-10 21:31:35,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 730 transitions. [2021-06-10 21:31:35,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:35,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 730 transitions. [2021-06-10 21:31:35,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 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-10 21:31:35,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 21:31:35,005 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 21:31:35,005 INFO L185 Difference]: Start difference. First operand has 58 places, 40 transitions, 290 flow. Second operand 5 states and 730 transitions. [2021-06-10 21:31:35,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 352 flow [2021-06-10 21:31:35,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 327 flow, removed 11 selfloop flow, removed 3 redundant places. [2021-06-10 21:31:35,008 INFO L241 Difference]: Finished difference. Result has 60 places, 48 transitions, 342 flow [2021-06-10 21:31:35,008 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=342, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2021-06-10 21:31:35,008 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2021-06-10 21:31:35,008 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 342 flow [2021-06-10 21:31:35,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,008 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:35,009 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:35,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-10 21:31:35,009 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:35,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:35,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1026438038, now seen corresponding path program 1 times [2021-06-10 21:31:35,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:35,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480549963] [2021-06-10 21:31:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:35,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:35,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:35,042 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 21:31:35,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:35,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:35,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-10 21:31:35,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480549963] [2021-06-10 21:31:35,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:35,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:35,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381471247] [2021-06-10 21:31:35,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:31:35,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:35,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:31:35,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:31:35,049 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 182 [2021-06-10 21:31:35,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 342 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:35,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 182 [2021-06-10 21:31:35,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:35,103 INFO L129 PetriNetUnfolder]: 116/290 cut-off events. [2021-06-10 21:31:35,103 INFO L130 PetriNetUnfolder]: For 1131/1561 co-relation queries the response was YES. [2021-06-10 21:31:35,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 290 events. 116/290 cut-off events. For 1131/1561 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1617 event pairs, 10 based on Foata normal form. 120/375 useless extension candidates. Maximal degree in co-relation 1193. Up to 163 conditions per place. [2021-06-10 21:31:35,105 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 5 selfloop transitions, 18 changer transitions 3/53 dead transitions. [2021-06-10 21:31:35,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 53 transitions, 408 flow [2021-06-10 21:31:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 21:31:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 21:31:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1022 transitions. [2021-06-10 21:31:35,107 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8021978021978022 [2021-06-10 21:31:35,107 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1022 transitions. [2021-06-10 21:31:35,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1022 transitions. [2021-06-10 21:31:35,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:35,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1022 transitions. [2021-06-10 21:31:35,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.0) internal successors, (1022), 7 states have internal predecessors, (1022), 0 states have call successors, (0), 0 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-10 21:31:35,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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-10 21:31:35,111 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 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-10 21:31:35,111 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 342 flow. Second operand 7 states and 1022 transitions. [2021-06-10 21:31:35,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 53 transitions, 408 flow [2021-06-10 21:31:35,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 382 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-06-10 21:31:35,114 INFO L241 Difference]: Finished difference. Result has 65 places, 50 transitions, 380 flow [2021-06-10 21:31:35,114 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2021-06-10 21:31:35,115 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2021-06-10 21:31:35,115 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 380 flow [2021-06-10 21:31:35,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 21:31:35,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:35,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:35,115 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-10 21:31:35,115 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:35,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:35,116 INFO L82 PathProgramCache]: Analyzing trace with hash -997913517, now seen corresponding path program 1 times [2021-06-10 21:31:35,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:35,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891412509] [2021-06-10 21:31:35,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:35,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:35,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:35,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:35,158 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-10 21:31:35,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-10 21:31:35,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:35,164 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-10 21:31:35,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891412509] [2021-06-10 21:31:35,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:35,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-10 21:31:35,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654026134] [2021-06-10 21:31:35,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 21:31:35,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:35,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 21:31:35,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-10 21:31:35,166 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 182 [2021-06-10 21:31:35,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 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-10 21:31:35,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:35,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 182 [2021-06-10 21:31:35,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:35,230 INFO L129 PetriNetUnfolder]: 77/218 cut-off events. [2021-06-10 21:31:35,231 INFO L130 PetriNetUnfolder]: For 1391/2085 co-relation queries the response was YES. [2021-06-10 21:31:35,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 218 events. 77/218 cut-off events. For 1391/2085 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1192 event pairs, 0 based on Foata normal form. 117/309 useless extension candidates. Maximal degree in co-relation 1077. Up to 129 conditions per place. [2021-06-10 21:31:35,233 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 2 selfloop transitions, 20 changer transitions 6/55 dead transitions. [2021-06-10 21:31:35,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 55 transitions, 474 flow [2021-06-10 21:31:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 21:31:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 21:31:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1308 transitions. [2021-06-10 21:31:35,236 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7985347985347986 [2021-06-10 21:31:35,236 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1308 transitions. [2021-06-10 21:31:35,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1308 transitions. [2021-06-10 21:31:35,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:35,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1308 transitions. [2021-06-10 21:31:35,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 145.33333333333334) internal successors, (1308), 9 states have internal predecessors, (1308), 0 states have call successors, (0), 0 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-10 21:31:35,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 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-10 21:31:35,240 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 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-10 21:31:35,240 INFO L185 Difference]: Start difference. First operand has 65 places, 50 transitions, 380 flow. Second operand 9 states and 1308 transitions. [2021-06-10 21:31:35,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 55 transitions, 474 flow [2021-06-10 21:31:35,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 395 flow, removed 28 selfloop flow, removed 7 redundant places. [2021-06-10 21:31:35,245 INFO L241 Difference]: Finished difference. Result has 69 places, 49 transitions, 352 flow [2021-06-10 21:31:35,245 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=352, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2021-06-10 21:31:35,245 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2021-06-10 21:31:35,245 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 352 flow [2021-06-10 21:31:35,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 0 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-10 21:31:35,245 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:35,245 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:35,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-10 21:31:35,246 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:35,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:35,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1481206739, now seen corresponding path program 1 times [2021-06-10 21:31:35,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:35,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23754043] [2021-06-10 21:31:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 21:31:35,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 21:31:35,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:35,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 21:31:35,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 21:31:35,276 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 21:31:35,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 21:31:35,287 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-10 21:31:35,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23754043] [2021-06-10 21:31:35,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 21:31:35,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-10 21:31:35,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754500106] [2021-06-10 21:31:35,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-10 21:31:35,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 21:31:35,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-10 21:31:35,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-10 21:31:35,289 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 182 [2021-06-10 21:31:35,290 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 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-10 21:31:35,290 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 21:31:35,290 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 182 [2021-06-10 21:31:35,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 21:31:35,336 INFO L129 PetriNetUnfolder]: 111/341 cut-off events. [2021-06-10 21:31:35,336 INFO L130 PetriNetUnfolder]: For 1539/1714 co-relation queries the response was YES. [2021-06-10 21:31:35,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 341 events. 111/341 cut-off events. For 1539/1714 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2317 event pairs, 0 based on Foata normal form. 13/306 useless extension candidates. Maximal degree in co-relation 1429. Up to 124 conditions per place. [2021-06-10 21:31:35,338 INFO L132 encePairwiseOnDemand]: 178/182 looper letters, 4 selfloop transitions, 2 changer transitions 9/51 dead transitions. [2021-06-10 21:31:35,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 51 transitions, 372 flow [2021-06-10 21:31:35,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-10 21:31:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-10 21:31:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2021-06-10 21:31:35,340 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.789010989010989 [2021-06-10 21:31:35,340 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2021-06-10 21:31:35,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2021-06-10 21:31:35,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 21:31:35,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2021-06-10 21:31:35,341 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-10 21:31:35,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 21:31:35,343 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 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-10 21:31:35,343 INFO L185 Difference]: Start difference. First operand has 69 places, 49 transitions, 352 flow. Second operand 5 states and 718 transitions. [2021-06-10 21:31:35,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 51 transitions, 372 flow [2021-06-10 21:31:35,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 51 transitions, 310 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-06-10 21:31:35,349 INFO L241 Difference]: Finished difference. Result has 67 places, 42 transitions, 258 flow [2021-06-10 21:31:35,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=67, PETRI_TRANSITIONS=42} [2021-06-10 21:31:35,350 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2021-06-10 21:31:35,350 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 258 flow [2021-06-10 21:31:35,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 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-10 21:31:35,350 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 21:31:35,350 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 21:31:35,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-10 21:31:35,350 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 21:31:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 21:31:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1382802335, now seen corresponding path program 2 times [2021-06-10 21:31:35,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 21:31:35,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847890320] [2021-06-10 21:31:35,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 21:31:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 21:31:35,370 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 21:31:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 21:31:35,396 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 21:31:35,416 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 21:31:35,416 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 21:31:35,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-10 21:31:35,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 09:31:35 BasicIcfg [2021-06-10 21:31:35,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 21:31:35,480 INFO L168 Benchmark]: Toolchain (without parser) took 8696.61 ms. Allocated memory was 343.9 MB in the beginning and 587.2 MB in the end (delta: 243.3 MB). Free memory was 307.1 MB in the beginning and 551.9 MB in the end (delta: -244.8 MB). Peak memory consumption was 329.4 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:35,480 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 343.9 MB. Free memory was 325.2 MB in the beginning and 325.1 MB in the end (delta: 99.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 21:31:35,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.73 ms. Allocated memory is still 343.9 MB. Free memory was 306.9 MB in the beginning and 304.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:35,480 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.90 ms. Allocated memory is still 343.9 MB. Free memory was 303.1 MB in the beginning and 301.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:35,480 INFO L168 Benchmark]: Boogie Preprocessor took 28.09 ms. Allocated memory is still 343.9 MB. Free memory was 301.0 MB in the beginning and 298.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:35,487 INFO L168 Benchmark]: RCFGBuilder took 1282.84 ms. Allocated memory is still 343.9 MB. Free memory was 298.9 MB in the beginning and 229.5 MB in the end (delta: 69.4 MB). Peak memory consumption was 113.3 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:35,488 INFO L168 Benchmark]: TraceAbstraction took 6923.24 ms. Allocated memory was 343.9 MB in the beginning and 587.2 MB in the end (delta: 243.3 MB). Free memory was 229.5 MB in the beginning and 551.9 MB in the end (delta: -322.4 MB). Peak memory consumption was 252.2 MB. Max. memory is 16.0 GB. [2021-06-10 21:31:35,489 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.09 ms. Allocated memory is still 343.9 MB. Free memory was 325.2 MB in the beginning and 325.1 MB in the end (delta: 99.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 419.73 ms. Allocated memory is still 343.9 MB. Free memory was 306.9 MB in the beginning and 304.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 36.90 ms. Allocated memory is still 343.9 MB. Free memory was 303.1 MB in the beginning and 301.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.09 ms. Allocated memory is still 343.9 MB. Free memory was 301.0 MB in the beginning and 298.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1282.84 ms. Allocated memory is still 343.9 MB. Free memory was 298.9 MB in the beginning and 229.5 MB in the end (delta: 69.4 MB). Peak memory consumption was 113.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6923.24 ms. Allocated memory was 343.9 MB in the beginning and 587.2 MB in the end (delta: 243.3 MB). Free memory was 229.5 MB in the beginning and 551.9 MB in the end (delta: -322.4 MB). Peak memory consumption was 252.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4436.4ms, 101 PlacesBefore, 35 PlacesAfterwards, 93 TransitionsBefore, 26 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, 4059 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2092, positive: 1955, positive conditional: 0, positive unconditional: 1955, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1154, positive: 1121, positive conditional: 0, positive unconditional: 1121, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1154, positive: 1121, positive conditional: 0, positive unconditional: 1121, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1154, positive: 1106, positive conditional: 0, positive unconditional: 1106, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 456, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 427, negative conditional: 0, negative unconditional: 427, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2092, positive: 834, positive conditional: 0, positive unconditional: 834, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 1154, unknown conditional: 0, unknown unconditional: 1154] , Statistics on independence cache: Total cache size (in pairs): 1975, Positive cache size: 1942, Positive conditional cache size: 0, Positive unconditional cache size: 1942, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - 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_p0_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; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2522; [L816] FCALL, FORK 0 pthread_create(&t2522, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, z=0] [L817] 0 pthread_t t2523; [L818] FCALL, FORK 0 pthread_create(&t2523, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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, z=0] [L819] 0 pthread_t t2524; [L820] FCALL, FORK 0 pthread_create(&t2524, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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=1, 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, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0: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=1, 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, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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=1, 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, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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=1, 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, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=1, 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, z=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, 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=1, 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, z=2] [L793] 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) [L793] 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) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 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 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 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 [L764] 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) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] 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) [L764] 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) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 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 [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 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 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L826] 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) [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L826] 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) [L826] 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) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 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 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 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 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 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) [L837] 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) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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)) [L841] 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)) [L841] 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)) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6771.8ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1071.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4522.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 67 SDtfs, 55 SDslu, 55 SDs, 0 SdLazy, 360 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 330.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 327.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=11, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 32.4ms SsaConstructionTime, 280.9ms SatisfiabilityAnalysisTime, 664.4ms InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...