/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:31:44,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:31:44,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:31:44,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:31:44,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:31:44,860 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:31:44,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:31:44,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:31:44,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:31:44,870 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:31:44,871 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:31:44,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:31:44,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:31:44,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:31:44,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:31:44,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:31:44,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:31:44,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:31:44,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:31:44,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:31:44,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:31:44,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:31:44,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:31:44,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:31:44,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:31:44,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:31:44,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:31:44,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:31:44,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:31:44,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:31:44,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:31:44,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:31:44,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:31:44,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:31:44,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:31:44,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:31:44,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:31:44,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:31:44,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:31:44,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:31:44,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:31:44,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:31:44,941 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:31:44,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:31:44,944 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:31:44,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:31:44,944 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:31:44,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:31:44,944 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:31:44,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:31:44,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:31:44,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:31:44,945 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:31:44,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:31:44,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:31:44,946 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:31:44,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:31:44,946 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:31:44,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:31:44,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:31:44,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:31:44,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:31:44,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:31:44,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:31:44,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:31:44,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:31:44,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:31:44,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:31:44,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:31:44,947 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:31:44,948 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:31:44,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:31:44,948 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:31:45,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:31:45,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:31:45,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:31:45,184 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:31:45,185 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:31:45,185 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2021-03-26 10:31:45,237 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec467e6b/4f697e6c34ec418b88d8b6a4727b566e/FLAG542b063e0 [2021-03-26 10:31:45,637 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:31:45,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt.i [2021-03-26 10:31:45,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec467e6b/4f697e6c34ec418b88d8b6a4727b566e/FLAG542b063e0 [2021-03-26 10:31:46,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bec467e6b/4f697e6c34ec418b88d8b6a4727b566e [2021-03-26 10:31:46,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:31:46,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:31:46,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:31:46,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:31:46,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:31:46,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c958cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46, skipping insertion in model container [2021-03-26 10:31:46,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:31:46,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:31:46,148 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/safe011_power.opt.i[951,964] [2021-03-26 10:31:46,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:31:46,320 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:31:46,327 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/safe011_power.opt.i[951,964] [2021-03-26 10:31:46,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:31:46,391 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:31:46,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46 WrapperNode [2021-03-26 10:31:46,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:31:46,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:31:46,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:31:46,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:31:46,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:31:46,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:31:46,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:31:46,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:31:46,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,472 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (1/1) ... [2021-03-26 10:31:46,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:31:46,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:31:46,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:31:46,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:31:46,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:31:46,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:31:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:31:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:31:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:31:46,554 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:31:46,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:31:46,555 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:31:46,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:31:46,555 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:31:46,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:31:46,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:31:46,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:31:46,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:31:46,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:31:46,557 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:31:47,897 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:31:47,897 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:31:47,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:31:47 BoogieIcfgContainer [2021-03-26 10:31:47,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:31:47,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:31:47,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:31:47,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:31:47,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:31:46" (1/3) ... [2021-03-26 10:31:47,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313ef783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:31:47, skipping insertion in model container [2021-03-26 10:31:47,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:31:46" (2/3) ... [2021-03-26 10:31:47,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313ef783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:31:47, skipping insertion in model container [2021-03-26 10:31:47,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:31:47" (3/3) ... [2021-03-26 10:31:47,903 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.opt.i [2021-03-26 10:31:47,907 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:31:47,910 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:31:47,910 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:31:47,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,936 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,936 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,937 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,937 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,938 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,940 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,940 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,940 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,941 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,941 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,941 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,944 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,947 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,947 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,949 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,950 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:31:47,950 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:31:47,962 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:31:47,975 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:31:47,975 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:31:47,975 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:31:47,975 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:31:47,975 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:31:47,975 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:31:47,975 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:31:47,975 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:31:47,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:31:48,005 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:31:48,005 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:48,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:31:48,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:31:48,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 10:31:48,011 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:48,020 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:31:48,022 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:31:48,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 10:31:48,035 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:31:48,036 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:48,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:31:48,038 INFO L142 LiptonReduction]: Number of co-enabled transitions 1686 [2021-03-26 10:31:49,575 WARN L205 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-26 10:31:49,834 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-26 10:31:51,154 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-26 10:31:51,686 WARN L205 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 10:31:51,850 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:31:52,180 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:31:53,302 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:31:53,565 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:31:54,680 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 265 DAG size of output: 264 [2021-03-26 10:31:55,247 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:31:55,371 INFO L154 LiptonReduction]: Checked pairs total: 2882 [2021-03-26 10:31:55,372 INFO L156 LiptonReduction]: Total number of compositions: 62 [2021-03-26 10:31:55,376 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7365 [2021-03-26 10:31:55,382 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-26 10:31:55,382 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:55,382 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:55,382 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:55,382 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:55,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:55,386 INFO L82 PathProgramCache]: Analyzing trace with hash 690179357, now seen corresponding path program 1 times [2021-03-26 10:31:55,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:55,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726505262] [2021-03-26 10:31:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:31:55,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:55,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:31:55,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:55,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:31:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:31:55,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726505262] [2021-03-26 10:31:55,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:31:55,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:31:55,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431308113] [2021-03-26 10:31:55,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:31:55,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:31:55,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:31:55,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:31:55,546 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 159 [2021-03-26 10:31:55,548 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:31:55,548 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:31:55,548 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 159 [2021-03-26 10:31:55,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:31:55,610 INFO L129 PetriNetUnfolder]: 69/200 cut-off events. [2021-03-26 10:31:55,610 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:55,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 200 events. 69/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 919 event pairs, 39 based on Foata normal form. 11/194 useless extension candidates. Maximal degree in co-relation 307. Up to 89 conditions per place. [2021-03-26 10:31:55,613 INFO L132 encePairwiseOnDemand]: 155/159 looper letters, 9 selfloop transitions, 2 changer transitions 5/43 dead transitions. [2021-03-26 10:31:55,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 121 flow [2021-03-26 10:31:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:31:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:31:55,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2021-03-26 10:31:55,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9014675052410901 [2021-03-26 10:31:55,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2021-03-26 10:31:55,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2021-03-26 10:31:55,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:31:55,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2021-03-26 10:31:55,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:31:55,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:31:55,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:31:55,639 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 91 flow. Second operand 3 states and 430 transitions. [2021-03-26 10:31:55,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 121 flow [2021-03-26 10:31:55,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:31:55,645 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 78 flow [2021-03-26 10:31:55,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-03-26 10:31:55,646 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2021-03-26 10:31:55,646 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:55,647 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 78 flow [2021-03-26 10:31:55,647 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 78 flow [2021-03-26 10:31:55,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-26 10:31:55,652 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 10:31:55,652 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:31:55,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:31:55,652 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 10:31:56,453 WARN L205 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 186 [2021-03-26 10:31:56,745 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:31:57,299 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:31:57,901 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:31:58,497 INFO L154 LiptonReduction]: Checked pairs total: 1242 [2021-03-26 10:31:58,497 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 10:31:58,497 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2851 [2021-03-26 10:31:58,498 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:31:58,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:31:58,498 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:58,498 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:58,499 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:31:58,499 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:58,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:58,499 INFO L82 PathProgramCache]: Analyzing trace with hash -76970503, now seen corresponding path program 1 times [2021-03-26 10:31:58,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:58,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40309887] [2021-03-26 10:31:58,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:31:58,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:58,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:31:58,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:58,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:31:58,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:58,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:31:58,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:58,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:31:58,614 INFO L142 QuantifierPusher]: treesize reduction 14, result has 48.1 percent of original size [2021-03-26 10:31:58,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:31:58,620 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:31:58,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:31:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:31:58,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40309887] [2021-03-26 10:31:58,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:31:58,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:31:58,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983457776] [2021-03-26 10:31:58,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:31:58,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:31:58,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:31:58,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:31:58,635 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 169 [2021-03-26 10:31:58,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 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-03-26 10:31:58,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:31:58,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 169 [2021-03-26 10:31:58,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:31:58,707 INFO L129 PetriNetUnfolder]: 84/175 cut-off events. [2021-03-26 10:31:58,707 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-26 10:31:58,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 175 events. 84/175 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 761 event pairs, 52 based on Foata normal form. 2/167 useless extension candidates. Maximal degree in co-relation 329. Up to 131 conditions per place. [2021-03-26 10:31:58,710 INFO L132 encePairwiseOnDemand]: 160/169 looper letters, 9 selfloop transitions, 10 changer transitions 0/33 dead transitions. [2021-03-26 10:31:58,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 116 flow [2021-03-26 10:31:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:31:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:31:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2021-03-26 10:31:58,714 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7810650887573964 [2021-03-26 10:31:58,714 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2021-03-26 10:31:58,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2021-03-26 10:31:58,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:31:58,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2021-03-26 10:31:58,717 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-03-26 10:31:58,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:31:58,720 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 169.0) internal successors, (1014), 6 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:31:58,720 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 660 transitions. [2021-03-26 10:31:58,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 116 flow [2021-03-26 10:31:58,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:31:58,721 INFO L241 Difference]: Finished difference. Result has 37 places, 31 transitions, 113 flow [2021-03-26 10:31:58,721 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2021-03-26 10:31:58,721 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -13 predicate places. [2021-03-26 10:31:58,721 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:58,721 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 113 flow [2021-03-26 10:31:58,722 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 113 flow [2021-03-26 10:31:58,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 113 flow [2021-03-26 10:31:58,732 INFO L129 PetriNetUnfolder]: 41/114 cut-off events. [2021-03-26 10:31:58,732 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2021-03-26 10:31:58,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 114 events. 41/114 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 441 event pairs, 21 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 217. Up to 60 conditions per place. [2021-03-26 10:31:58,733 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-26 10:31:59,339 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:31:59,466 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:31:59,742 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:31:59,863 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:31:59,867 INFO L154 LiptonReduction]: Checked pairs total: 531 [2021-03-26 10:31:59,867 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:31:59,867 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1146 [2021-03-26 10:31:59,868 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 105 flow [2021-03-26 10:31:59,868 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-03-26 10:31:59,868 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:59,868 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:59,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:31:59,869 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash 202278089, now seen corresponding path program 1 times [2021-03-26 10:31:59,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:59,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042982182] [2021-03-26 10:31:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:31:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:31:59,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:31:59,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:31:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:31:59,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042982182] [2021-03-26 10:31:59,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:31:59,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:31:59,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194002113] [2021-03-26 10:31:59,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:31:59,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:31:59,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:31:59,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:31:59,941 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2021-03-26 10:31:59,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 105 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-03-26 10:31:59,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:31:59,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2021-03-26 10:31:59,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:31:59,960 INFO L129 PetriNetUnfolder]: 41/109 cut-off events. [2021-03-26 10:31:59,960 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-26 10:31:59,962 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 109 events. 41/109 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 405 event pairs, 20 based on Foata normal form. 6/111 useless extension candidates. Maximal degree in co-relation 231. Up to 62 conditions per place. [2021-03-26 10:31:59,962 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 2 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-03-26 10:31:59,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 113 flow [2021-03-26 10:31:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:31:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:31:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2021-03-26 10:31:59,964 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.884990253411306 [2021-03-26 10:31:59,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2021-03-26 10:31:59,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2021-03-26 10:31:59,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:31:59,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2021-03-26 10:31:59,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:31:59,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:31:59,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:31:59,966 INFO L185 Difference]: Start difference. First operand has 34 places, 29 transitions, 105 flow. Second operand 3 states and 454 transitions. [2021-03-26 10:31:59,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 113 flow [2021-03-26 10:31:59,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 111 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 10:31:59,968 INFO L241 Difference]: Finished difference. Result has 37 places, 29 transitions, 113 flow [2021-03-26 10:31:59,968 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2021-03-26 10:31:59,968 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -13 predicate places. [2021-03-26 10:31:59,968 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:31:59,968 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 113 flow [2021-03-26 10:31:59,968 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 113 flow [2021-03-26 10:31:59,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 113 flow [2021-03-26 10:31:59,978 INFO L129 PetriNetUnfolder]: 39/114 cut-off events. [2021-03-26 10:31:59,978 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-03-26 10:31:59,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 114 events. 39/114 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 462 event pairs, 18 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 231. Up to 56 conditions per place. [2021-03-26 10:31:59,979 INFO L142 LiptonReduction]: Number of co-enabled transitions 314 [2021-03-26 10:31:59,981 INFO L154 LiptonReduction]: Checked pairs total: 139 [2021-03-26 10:31:59,981 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:31:59,981 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-26 10:31:59,982 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 113 flow [2021-03-26 10:31:59,982 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-03-26 10:31:59,982 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:31:59,982 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:31:59,983 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:31:59,983 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:31:59,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:31:59,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1399623350, now seen corresponding path program 1 times [2021-03-26 10:31:59,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:31:59,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148778099] [2021-03-26 10:31:59,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:32:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:32:00,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:32:00,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148778099] [2021-03-26 10:32:00,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:32:00,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:32:00,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706250305] [2021-03-26 10:32:00,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:32:00,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:32:00,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:32:00,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:32:00,039 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2021-03-26 10:32:00,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 113 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-03-26 10:32:00,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:32:00,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2021-03-26 10:32:00,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:32:00,063 INFO L129 PetriNetUnfolder]: 69/160 cut-off events. [2021-03-26 10:32:00,063 INFO L130 PetriNetUnfolder]: For 153/168 co-relation queries the response was YES. [2021-03-26 10:32:00,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 160 events. 69/160 cut-off events. For 153/168 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 706 event pairs, 33 based on Foata normal form. 5/146 useless extension candidates. Maximal degree in co-relation 391. Up to 96 conditions per place. [2021-03-26 10:32:00,064 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 4 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-26 10:32:00,064 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 131 flow [2021-03-26 10:32:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:32:00,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:32:00,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-26 10:32:00,066 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8908382066276803 [2021-03-26 10:32:00,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-26 10:32:00,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-26 10:32:00,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:32:00,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-26 10:32:00,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,068 INFO L185 Difference]: Start difference. First operand has 37 places, 29 transitions, 113 flow. Second operand 3 states and 457 transitions. [2021-03-26 10:32:00,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 131 flow [2021-03-26 10:32:00,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:32:00,070 INFO L241 Difference]: Finished difference. Result has 38 places, 31 transitions, 130 flow [2021-03-26 10:32:00,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2021-03-26 10:32:00,070 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -12 predicate places. [2021-03-26 10:32:00,070 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:32:00,071 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 31 transitions, 130 flow [2021-03-26 10:32:00,071 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 31 transitions, 130 flow [2021-03-26 10:32:00,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 130 flow [2021-03-26 10:32:00,085 INFO L129 PetriNetUnfolder]: 63/166 cut-off events. [2021-03-26 10:32:00,085 INFO L130 PetriNetUnfolder]: For 134/150 co-relation queries the response was YES. [2021-03-26 10:32:00,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 166 events. 63/166 cut-off events. For 134/150 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 785 event pairs, 31 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 383. Up to 91 conditions per place. [2021-03-26 10:32:00,087 INFO L142 LiptonReduction]: Number of co-enabled transitions 340 [2021-03-26 10:32:00,089 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-26 10:32:00,089 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:32:00,090 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 10:32:00,090 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 130 flow [2021-03-26 10:32:00,091 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-03-26 10:32:00,091 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:32:00,091 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:32:00,091 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:32:00,091 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:32:00,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:32:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash -157425172, now seen corresponding path program 1 times [2021-03-26 10:32:00,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:32:00,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570485542] [2021-03-26 10:32:00,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:32:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:32:00,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:32:00,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:00,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:32:00,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570485542] [2021-03-26 10:32:00,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:32:00,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:32:00,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682002597] [2021-03-26 10:32:00,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:32:00,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:32:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:32:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:32:00,149 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 171 [2021-03-26 10:32:00,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,150 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:32:00,150 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 171 [2021-03-26 10:32:00,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:32:00,173 INFO L129 PetriNetUnfolder]: 74/190 cut-off events. [2021-03-26 10:32:00,173 INFO L130 PetriNetUnfolder]: For 373/456 co-relation queries the response was YES. [2021-03-26 10:32:00,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 190 events. 74/190 cut-off events. For 373/456 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 954 event pairs, 35 based on Foata normal form. 18/191 useless extension candidates. Maximal degree in co-relation 455. Up to 109 conditions per place. [2021-03-26 10:32:00,174 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 4 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-26 10:32:00,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 144 flow [2021-03-26 10:32:00,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:32:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:32:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2021-03-26 10:32:00,176 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-26 10:32:00,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2021-03-26 10:32:00,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2021-03-26 10:32:00,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:32:00,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2021-03-26 10:32:00,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,179 INFO L185 Difference]: Start difference. First operand has 38 places, 31 transitions, 130 flow. Second operand 3 states and 456 transitions. [2021-03-26 10:32:00,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 144 flow [2021-03-26 10:32:00,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:32:00,180 INFO L241 Difference]: Finished difference. Result has 40 places, 31 transitions, 140 flow [2021-03-26 10:32:00,180 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=37, 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=3, PETRI_FLOW=140, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2021-03-26 10:32:00,181 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2021-03-26 10:32:00,181 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:32:00,181 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 140 flow [2021-03-26 10:32:00,181 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 140 flow [2021-03-26 10:32:00,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 140 flow [2021-03-26 10:32:00,196 INFO L129 PetriNetUnfolder]: 71/202 cut-off events. [2021-03-26 10:32:00,197 INFO L130 PetriNetUnfolder]: For 217/245 co-relation queries the response was YES. [2021-03-26 10:32:00,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 202 events. 71/202 cut-off events. For 217/245 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1069 event pairs, 35 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 453. Up to 105 conditions per place. [2021-03-26 10:32:00,199 INFO L142 LiptonReduction]: Number of co-enabled transitions 340 [2021-03-26 10:32:00,202 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-26 10:32:00,202 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:32:00,203 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 10:32:00,203 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 140 flow [2021-03-26 10:32:00,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,204 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:32:00,204 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:32:00,204 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:32:00,204 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:32:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:32:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1245615737, now seen corresponding path program 1 times [2021-03-26 10:32:00,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:32:00,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622394936] [2021-03-26 10:32:00,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:32:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:32:00,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:00,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:32:00,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622394936] [2021-03-26 10:32:00,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:32:00,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:32:00,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333809680] [2021-03-26 10:32:00,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:32:00,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:32:00,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:32:00,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:32:00,240 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 171 [2021-03-26 10:32:00,241 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,241 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:32:00,241 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 171 [2021-03-26 10:32:00,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:32:00,300 INFO L129 PetriNetUnfolder]: 99/274 cut-off events. [2021-03-26 10:32:00,300 INFO L130 PetriNetUnfolder]: For 774/858 co-relation queries the response was YES. [2021-03-26 10:32:00,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 274 events. 99/274 cut-off events. For 774/858 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1603 event pairs, 45 based on Foata normal form. 33/283 useless extension candidates. Maximal degree in co-relation 618. Up to 151 conditions per place. [2021-03-26 10:32:00,303 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 3 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-03-26 10:32:00,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 155 flow [2021-03-26 10:32:00,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:32:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:32:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2021-03-26 10:32:00,305 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8581871345029239 [2021-03-26 10:32:00,305 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2021-03-26 10:32:00,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2021-03-26 10:32:00,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:32:00,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2021-03-26 10:32:00,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,308 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,308 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 140 flow. Second operand 4 states and 587 transitions. [2021-03-26 10:32:00,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 155 flow [2021-03-26 10:32:00,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 150 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:32:00,311 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 158 flow [2021-03-26 10:32:00,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-03-26 10:32:00,311 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2021-03-26 10:32:00,311 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:32:00,312 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 158 flow [2021-03-26 10:32:00,312 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 158 flow [2021-03-26 10:32:00,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 158 flow [2021-03-26 10:32:00,335 INFO L129 PetriNetUnfolder]: 100/287 cut-off events. [2021-03-26 10:32:00,335 INFO L130 PetriNetUnfolder]: For 393/418 co-relation queries the response was YES. [2021-03-26 10:32:00,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 287 events. 100/287 cut-off events. For 393/418 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1719 event pairs, 50 based on Foata normal form. 5/271 useless extension candidates. Maximal degree in co-relation 636. Up to 146 conditions per place. [2021-03-26 10:32:00,337 INFO L142 LiptonReduction]: Number of co-enabled transitions 350 [2021-03-26 10:32:00,344 INFO L154 LiptonReduction]: Checked pairs total: 71 [2021-03-26 10:32:00,344 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:32:00,344 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-26 10:32:00,345 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 158 flow [2021-03-26 10:32:00,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,345 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:32:00,345 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:32:00,345 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:32:00,345 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:32:00,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:32:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1161526503, now seen corresponding path program 1 times [2021-03-26 10:32:00,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:32:00,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597250228] [2021-03-26 10:32:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:32:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:32:00,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:00,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:00,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:32:00,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:32:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:32:00,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597250228] [2021-03-26 10:32:00,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:32:00,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:32:00,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477238929] [2021-03-26 10:32:00,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:32:00,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:32:00,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:32:00,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:32:00,429 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 171 [2021-03-26 10:32:00,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:32:00,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 171 [2021-03-26 10:32:00,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:32:00,512 INFO L129 PetriNetUnfolder]: 237/536 cut-off events. [2021-03-26 10:32:00,512 INFO L130 PetriNetUnfolder]: For 912/1069 co-relation queries the response was YES. [2021-03-26 10:32:00,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 536 events. 237/536 cut-off events. For 912/1069 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3307 event pairs, 72 based on Foata normal form. 16/524 useless extension candidates. Maximal degree in co-relation 1493. Up to 324 conditions per place. [2021-03-26 10:32:00,514 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 13 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2021-03-26 10:32:00,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 216 flow [2021-03-26 10:32:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:32:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:32:00,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2021-03-26 10:32:00,516 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2021-03-26 10:32:00,516 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2021-03-26 10:32:00,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2021-03-26 10:32:00,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:32:00,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2021-03-26 10:32:00,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,518 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,518 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 158 flow. Second operand 4 states and 570 transitions. [2021-03-26 10:32:00,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 216 flow [2021-03-26 10:32:00,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 37 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:32:00,521 INFO L241 Difference]: Finished difference. Result has 46 places, 35 transitions, 190 flow [2021-03-26 10:32:00,521 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2021-03-26 10:32:00,521 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2021-03-26 10:32:00,521 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:32:00,521 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 190 flow [2021-03-26 10:32:00,521 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 190 flow [2021-03-26 10:32:00,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 190 flow [2021-03-26 10:32:00,557 INFO L129 PetriNetUnfolder]: 189/463 cut-off events. [2021-03-26 10:32:00,557 INFO L130 PetriNetUnfolder]: For 757/824 co-relation queries the response was YES. [2021-03-26 10:32:00,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 463 events. 189/463 cut-off events. For 757/824 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2967 event pairs, 57 based on Foata normal form. 9/432 useless extension candidates. Maximal degree in co-relation 1309. Up to 234 conditions per place. [2021-03-26 10:32:00,560 INFO L142 LiptonReduction]: Number of co-enabled transitions 382 [2021-03-26 10:32:00,592 INFO L154 LiptonReduction]: Checked pairs total: 35 [2021-03-26 10:32:00,592 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:32:00,592 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-26 10:32:00,594 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 190 flow [2021-03-26 10:32:00,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,594 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:32:00,594 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:32:00,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:32:00,596 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:32:00,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:32:00,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1707120501, now seen corresponding path program 1 times [2021-03-26 10:32:00,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:32:00,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920713938] [2021-03-26 10:32:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:32:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:32:00,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:32:00,681 INFO L142 QuantifierPusher]: treesize reduction 10, result has 52.4 percent of original size [2021-03-26 10:32:00,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:32:00,689 INFO L142 QuantifierPusher]: treesize reduction 26, result has 31.6 percent of original size [2021-03-26 10:32:00,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:32:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:32:00,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920713938] [2021-03-26 10:32:00,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:32:00,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:32:00,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827814261] [2021-03-26 10:32:00,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:32:00,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:32:00,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:32:00,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:32:00,698 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 171 [2021-03-26 10:32:00,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 190 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-03-26 10:32:00,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:32:00,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 171 [2021-03-26 10:32:00,699 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:32:00,815 INFO L129 PetriNetUnfolder]: 248/579 cut-off events. [2021-03-26 10:32:00,815 INFO L130 PetriNetUnfolder]: For 1171/1418 co-relation queries the response was YES. [2021-03-26 10:32:00,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 579 events. 248/579 cut-off events. For 1171/1418 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3760 event pairs, 16 based on Foata normal form. 51/609 useless extension candidates. Maximal degree in co-relation 1967. Up to 326 conditions per place. [2021-03-26 10:32:00,817 INFO L132 encePairwiseOnDemand]: 164/171 looper letters, 16 selfloop transitions, 11 changer transitions 5/49 dead transitions. [2021-03-26 10:32:00,817 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 321 flow [2021-03-26 10:32:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:32:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:32:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2021-03-26 10:32:00,819 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7730994152046784 [2021-03-26 10:32:00,819 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2021-03-26 10:32:00,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2021-03-26 10:32:00,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:32:00,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2021-03-26 10:32:00,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,822 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,822 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 190 flow. Second operand 5 states and 661 transitions. [2021-03-26 10:32:00,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 321 flow [2021-03-26 10:32:00,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:32:00,825 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 240 flow [2021-03-26 10:32:00,825 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2021-03-26 10:32:00,825 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2021-03-26 10:32:00,825 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:32:00,825 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 240 flow [2021-03-26 10:32:00,825 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 240 flow [2021-03-26 10:32:00,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 240 flow [2021-03-26 10:32:00,865 INFO L129 PetriNetUnfolder]: 201/500 cut-off events. [2021-03-26 10:32:00,866 INFO L130 PetriNetUnfolder]: For 835/984 co-relation queries the response was YES. [2021-03-26 10:32:00,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 500 events. 201/500 cut-off events. For 835/984 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3286 event pairs, 51 based on Foata normal form. 13/475 useless extension candidates. Maximal degree in co-relation 1629. Up to 264 conditions per place. [2021-03-26 10:32:00,869 INFO L142 LiptonReduction]: Number of co-enabled transitions 432 [2021-03-26 10:32:00,886 INFO L154 LiptonReduction]: Checked pairs total: 127 [2021-03-26 10:32:00,887 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:32:00,887 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62 [2021-03-26 10:32:00,887 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 240 flow [2021-03-26 10:32:00,888 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-03-26 10:32:00,888 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:32:00,888 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:32:00,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:32:00,888 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:32:00,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:32:00,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1382468728, now seen corresponding path program 1 times [2021-03-26 10:32:00,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:32:00,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561428030] [2021-03-26 10:32:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:32:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:32:00,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:00,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:00,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:00,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:32:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:32:00,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561428030] [2021-03-26 10:32:00,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:32:00,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:32:00,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587905809] [2021-03-26 10:32:00,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:32:00,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:32:00,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:32:00,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:32:00,942 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 171 [2021-03-26 10:32:00,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:00,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:32:00,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 171 [2021-03-26 10:32:00,943 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:32:01,061 INFO L129 PetriNetUnfolder]: 495/1073 cut-off events. [2021-03-26 10:32:01,062 INFO L130 PetriNetUnfolder]: For 1384/1703 co-relation queries the response was YES. [2021-03-26 10:32:01,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 1073 events. 495/1073 cut-off events. For 1384/1703 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 7786 event pairs, 132 based on Foata normal form. 204/1081 useless extension candidates. Maximal degree in co-relation 2984. Up to 615 conditions per place. [2021-03-26 10:32:01,066 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 8 changer transitions 2/50 dead transitions. [2021-03-26 10:32:01,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 300 flow [2021-03-26 10:32:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:32:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:32:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2021-03-26 10:32:01,068 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8362573099415205 [2021-03-26 10:32:01,068 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2021-03-26 10:32:01,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2021-03-26 10:32:01,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:32:01,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2021-03-26 10:32:01,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-03-26 10:32:01,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,071 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,071 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 240 flow. Second operand 5 states and 715 transitions. [2021-03-26 10:32:01,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 300 flow [2021-03-26 10:32:01,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 284 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:32:01,074 INFO L241 Difference]: Finished difference. Result has 53 places, 44 transitions, 271 flow [2021-03-26 10:32:01,074 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2021-03-26 10:32:01,074 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2021-03-26 10:32:01,074 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:32:01,074 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 44 transitions, 271 flow [2021-03-26 10:32:01,074 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 44 transitions, 271 flow [2021-03-26 10:32:01,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 44 transitions, 271 flow [2021-03-26 10:32:01,133 INFO L129 PetriNetUnfolder]: 376/866 cut-off events. [2021-03-26 10:32:01,133 INFO L130 PetriNetUnfolder]: For 1781/2105 co-relation queries the response was YES. [2021-03-26 10:32:01,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 866 events. 376/866 cut-off events. For 1781/2105 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 6408 event pairs, 114 based on Foata normal form. 77/872 useless extension candidates. Maximal degree in co-relation 2920. Up to 420 conditions per place. [2021-03-26 10:32:01,140 INFO L142 LiptonReduction]: Number of co-enabled transitions 548 [2021-03-26 10:32:01,155 INFO L154 LiptonReduction]: Checked pairs total: 24 [2021-03-26 10:32:01,155 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:32:01,155 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 81 [2021-03-26 10:32:01,157 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 265 flow [2021-03-26 10:32:01,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,157 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:32:01,157 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:32:01,157 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:32:01,157 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:32:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:32:01,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1966594828, now seen corresponding path program 1 times [2021-03-26 10:32:01,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:32:01,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305297420] [2021-03-26 10:32:01,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:32:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:32:01,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:01,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:01,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:01,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:01,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:01,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:01,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:01,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:32:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:32:01,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305297420] [2021-03-26 10:32:01,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:32:01,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:32:01,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21027742] [2021-03-26 10:32:01,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:32:01,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:32:01,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:32:01,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:32:01,216 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 171 [2021-03-26 10:32:01,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:32:01,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 171 [2021-03-26 10:32:01,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:32:01,303 INFO L129 PetriNetUnfolder]: 280/692 cut-off events. [2021-03-26 10:32:01,303 INFO L130 PetriNetUnfolder]: For 1511/2156 co-relation queries the response was YES. [2021-03-26 10:32:01,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 692 events. 280/692 cut-off events. For 1511/2156 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4796 event pairs, 27 based on Foata normal form. 187/798 useless extension candidates. Maximal degree in co-relation 2493. Up to 383 conditions per place. [2021-03-26 10:32:01,307 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 8 selfloop transitions, 11 changer transitions 3/52 dead transitions. [2021-03-26 10:32:01,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 353 flow [2021-03-26 10:32:01,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:32:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:32:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 858 transitions. [2021-03-26 10:32:01,309 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8362573099415205 [2021-03-26 10:32:01,309 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 858 transitions. [2021-03-26 10:32:01,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 858 transitions. [2021-03-26 10:32:01,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:32:01,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 858 transitions. [2021-03-26 10:32:01,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,312 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,312 INFO L185 Difference]: Start difference. First operand has 53 places, 43 transitions, 265 flow. Second operand 6 states and 858 transitions. [2021-03-26 10:32:01,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 353 flow [2021-03-26 10:32:01,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 347 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:32:01,316 INFO L241 Difference]: Finished difference. Result has 57 places, 47 transitions, 329 flow [2021-03-26 10:32:01,317 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=329, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2021-03-26 10:32:01,317 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2021-03-26 10:32:01,317 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:32:01,317 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 329 flow [2021-03-26 10:32:01,317 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 47 transitions, 329 flow [2021-03-26 10:32:01,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 47 transitions, 329 flow [2021-03-26 10:32:01,352 INFO L129 PetriNetUnfolder]: 163/489 cut-off events. [2021-03-26 10:32:01,352 INFO L130 PetriNetUnfolder]: For 1286/1498 co-relation queries the response was YES. [2021-03-26 10:32:01,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 489 events. 163/489 cut-off events. For 1286/1498 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3346 event pairs, 17 based on Foata normal form. 14/484 useless extension candidates. Maximal degree in co-relation 1941. Up to 262 conditions per place. [2021-03-26 10:32:01,356 INFO L142 LiptonReduction]: Number of co-enabled transitions 496 [2021-03-26 10:32:01,369 INFO L154 LiptonReduction]: Checked pairs total: 22 [2021-03-26 10:32:01,369 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:32:01,369 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-26 10:32:01,371 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 321 flow [2021-03-26 10:32:01,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:32:01,371 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:32:01,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:32:01,371 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:32:01,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:32:01,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1345778661, now seen corresponding path program 1 times [2021-03-26 10:32:01,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:32:01,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437399424] [2021-03-26 10:32:01,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:32:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:32:01,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:01,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:01,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:01,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:01,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:01,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:01,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:01,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:32:01,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:32:01,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:32:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:32:01,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437399424] [2021-03-26 10:32:01,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:32:01,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:32:01,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947987385] [2021-03-26 10:32:01,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:32:01,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:32:01,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:32:01,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:32:01,434 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 171 [2021-03-26 10:32:01,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:32:01,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 171 [2021-03-26 10:32:01,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:32:01,505 INFO L129 PetriNetUnfolder]: 216/516 cut-off events. [2021-03-26 10:32:01,506 INFO L130 PetriNetUnfolder]: For 1463/1917 co-relation queries the response was YES. [2021-03-26 10:32:01,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2077 conditions, 516 events. 216/516 cut-off events. For 1463/1917 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3193 event pairs, 11 based on Foata normal form. 92/533 useless extension candidates. Maximal degree in co-relation 2051. Up to 261 conditions per place. [2021-03-26 10:32:01,509 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 5 selfloop transitions, 11 changer transitions 8/50 dead transitions. [2021-03-26 10:32:01,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 367 flow [2021-03-26 10:32:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:32:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:32:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 995 transitions. [2021-03-26 10:32:01,511 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8312447786131997 [2021-03-26 10:32:01,511 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 995 transitions. [2021-03-26 10:32:01,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 995 transitions. [2021-03-26 10:32:01,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:32:01,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 995 transitions. [2021-03-26 10:32:01,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,515 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:01,515 INFO L185 Difference]: Start difference. First operand has 57 places, 46 transitions, 321 flow. Second operand 7 states and 995 transitions. [2021-03-26 10:32:01,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 367 flow [2021-03-26 10:32:01,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 322 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-26 10:32:01,523 INFO L241 Difference]: Finished difference. Result has 59 places, 40 transitions, 264 flow [2021-03-26 10:32:01,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=264, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2021-03-26 10:32:01,523 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2021-03-26 10:32:01,523 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:32:01,523 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 40 transitions, 264 flow [2021-03-26 10:32:01,523 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 40 transitions, 264 flow [2021-03-26 10:32:01,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 40 transitions, 264 flow [2021-03-26 10:32:01,533 INFO L129 PetriNetUnfolder]: 38/129 cut-off events. [2021-03-26 10:32:01,533 INFO L130 PetriNetUnfolder]: For 208/232 co-relation queries the response was YES. [2021-03-26 10:32:01,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 129 events. 38/129 cut-off events. For 208/232 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 538 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 483. Up to 42 conditions per place. [2021-03-26 10:32:01,534 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-26 10:32:01,891 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:32:02,027 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:32:02,185 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-26 10:32:02,440 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-26 10:32:03,074 WARN L205 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 192 [2021-03-26 10:32:03,284 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:32:04,572 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 347 DAG size of output: 268 [2021-03-26 10:32:05,036 WARN L205 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 250 [2021-03-26 10:32:05,041 INFO L154 LiptonReduction]: Checked pairs total: 52 [2021-03-26 10:32:05,041 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 10:32:05,041 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3518 [2021-03-26 10:32:05,041 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 251 flow [2021-03-26 10:32:05,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:05,041 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:32:05,042 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:32:05,042 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:32:05,042 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:32:05,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:32:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1447350754, now seen corresponding path program 1 times [2021-03-26 10:32:05,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:32:05,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703096073] [2021-03-26 10:32:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:32:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:32:05,097 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 10:32:05,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 10:32:05,119 INFO L142 QuantifierPusher]: treesize reduction 19, result has 69.4 percent of original size [2021-03-26 10:32:05,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-26 10:32:05,147 INFO L142 QuantifierPusher]: treesize reduction 14, result has 78.5 percent of original size [2021-03-26 10:32:05,148 INFO L147 QuantifierPusher]: treesize reduction 5, result has 90.2 percent of original size 46 [2021-03-26 10:32:05,191 INFO L142 QuantifierPusher]: treesize reduction 14, result has 78.8 percent of original size [2021-03-26 10:32:05,194 INFO L147 QuantifierPusher]: treesize reduction 5, result has 90.4 percent of original size 47 [2021-03-26 10:32:05,232 INFO L142 QuantifierPusher]: treesize reduction 13, result has 63.9 percent of original size [2021-03-26 10:32:05,235 INFO L147 QuantifierPusher]: treesize reduction 5, result has 78.3 percent of original size 18 [2021-03-26 10:32:05,258 INFO L142 QuantifierPusher]: treesize reduction 10, result has 64.3 percent of original size [2021-03-26 10:32:05,258 INFO L147 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size 15 [2021-03-26 10:32:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:32:05,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703096073] [2021-03-26 10:32:05,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:32:05,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:32:05,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611850909] [2021-03-26 10:32:05,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:32:05,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:32:05,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:32:05,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:32:05,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 177 [2021-03-26 10:32:05,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 251 flow. Second operand has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:05,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:32:05,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 177 [2021-03-26 10:32:05,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:32:05,386 INFO L129 PetriNetUnfolder]: 48/146 cut-off events. [2021-03-26 10:32:05,386 INFO L130 PetriNetUnfolder]: For 572/644 co-relation queries the response was YES. [2021-03-26 10:32:05,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 146 events. 48/146 cut-off events. For 572/644 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 704 event pairs, 0 based on Foata normal form. 26/164 useless extension candidates. Maximal degree in co-relation 615. Up to 53 conditions per place. [2021-03-26 10:32:05,387 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 6 selfloop transitions, 10 changer transitions 5/38 dead transitions. [2021-03-26 10:32:05,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 38 transitions, 311 flow [2021-03-26 10:32:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:32:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:32:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2021-03-26 10:32:05,389 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7259887005649718 [2021-03-26 10:32:05,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2021-03-26 10:32:05,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2021-03-26 10:32:05,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:32:05,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2021-03-26 10:32:05,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:05,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:05,392 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:05,392 INFO L185 Difference]: Start difference. First operand has 52 places, 35 transitions, 251 flow. Second operand 6 states and 771 transitions. [2021-03-26 10:32:05,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 38 transitions, 311 flow [2021-03-26 10:32:05,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 262 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-03-26 10:32:05,394 INFO L241 Difference]: Finished difference. Result has 50 places, 31 transitions, 205 flow [2021-03-26 10:32:05,394 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2021-03-26 10:32:05,394 INFO L343 CegarLoopForPetriNet]: 50 programPoint places, 0 predicate places. [2021-03-26 10:32:05,395 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:32:05,395 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 31 transitions, 205 flow [2021-03-26 10:32:05,395 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 31 transitions, 205 flow [2021-03-26 10:32:05,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 31 transitions, 205 flow [2021-03-26 10:32:05,399 INFO L129 PetriNetUnfolder]: 14/49 cut-off events. [2021-03-26 10:32:05,399 INFO L130 PetriNetUnfolder]: For 73/74 co-relation queries the response was YES. [2021-03-26 10:32:05,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 49 events. 14/49 cut-off events. For 73/74 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 119 event pairs, 1 based on Foata normal form. 1/50 useless extension candidates. Maximal degree in co-relation 160. Up to 16 conditions per place. [2021-03-26 10:32:05,400 INFO L142 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-26 10:32:05,607 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2021-03-26 10:32:06,013 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 95 [2021-03-26 10:32:06,148 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:32:06,151 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-26 10:32:06,151 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:32:06,152 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 758 [2021-03-26 10:32:06,152 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 211 flow [2021-03-26 10:32:06,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:32:06,152 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:32:06,152 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:32:06,152 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:32:06,153 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:32:06,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:32:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2060607443, now seen corresponding path program 1 times [2021-03-26 10:32:06,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:32:06,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001627228] [2021-03-26 10:32:06,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:32:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:32:06,176 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:32:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:32:06,194 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:32:06,231 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:32:06,231 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:32:06,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:32:06,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:32:06 BasicIcfg [2021-03-26 10:32:06,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:32:06,303 INFO L168 Benchmark]: Toolchain (without parser) took 20287.31 ms. Allocated memory was 255.9 MB in the beginning and 738.2 MB in the end (delta: 482.3 MB). Free memory was 236.8 MB in the beginning and 636.0 MB in the end (delta: -399.1 MB). Peak memory consumption was 82.3 MB. Max. memory is 16.0 GB. [2021-03-26 10:32:06,303 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:32:06,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.12 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 236.8 MB in the beginning and 314.9 MB in the end (delta: -78.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:32:06,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.81 ms. Allocated memory is still 354.4 MB. Free memory was 314.9 MB in the beginning and 312.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:32:06,304 INFO L168 Benchmark]: Boogie Preprocessor took 49.44 ms. Allocated memory is still 354.4 MB. Free memory was 312.0 MB in the beginning and 309.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:32:06,304 INFO L168 Benchmark]: RCFGBuilder took 1423.50 ms. Allocated memory was 354.4 MB in the beginning and 425.7 MB in the end (delta: 71.3 MB). Free memory was 309.9 MB in the beginning and 391.6 MB in the end (delta: -81.6 MB). Peak memory consumption was 67.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:32:06,304 INFO L168 Benchmark]: TraceAbstraction took 18402.86 ms. Allocated memory was 425.7 MB in the beginning and 738.2 MB in the end (delta: 312.5 MB). Free memory was 391.6 MB in the beginning and 636.0 MB in the end (delta: -244.4 MB). Peak memory consumption was 67.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:32:06,305 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.34 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 375.12 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 236.8 MB in the beginning and 314.9 MB in the end (delta: -78.1 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 32.81 ms. Allocated memory is still 354.4 MB. Free memory was 314.9 MB in the beginning and 312.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 49.44 ms. Allocated memory is still 354.4 MB. Free memory was 312.0 MB in the beginning and 309.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1423.50 ms. Allocated memory was 354.4 MB in the beginning and 425.7 MB in the end (delta: 71.3 MB). Free memory was 309.9 MB in the beginning and 391.6 MB in the end (delta: -81.6 MB). Peak memory consumption was 67.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18402.86 ms. Allocated memory was 425.7 MB in the beginning and 738.2 MB in the end (delta: 312.5 MB). Free memory was 391.6 MB in the beginning and 636.0 MB in the end (delta: -244.4 MB). Peak memory consumption was 67.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7349.7ms, 102 PlacesBefore, 50 PlacesAfterwards, 94 TransitionsBefore, 41 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 4 FixpointIterations, 24 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 62 TotalNumberOfCompositions, 2882 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1489, positive: 1417, positive conditional: 1417, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1489, positive: 1417, positive conditional: 0, positive unconditional: 1417, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1489, positive: 1417, positive conditional: 0, positive unconditional: 1417, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1137, positive: 1097, positive conditional: 0, positive unconditional: 1097, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1137, positive: 1088, positive conditional: 0, positive unconditional: 1088, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 560, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 535, negative conditional: 0, negative unconditional: 535, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1489, positive: 320, positive conditional: 0, positive unconditional: 320, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 1137, unknown conditional: 0, unknown unconditional: 1137] , Statistics on independence cache: Total cache size (in pairs): 1137, Positive cache size: 1097, Positive conditional cache size: 0, Positive unconditional cache size: 1097, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2850.1ms, 47 PlacesBefore, 33 PlacesAfterwards, 34 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 1242 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 333, positive: 244, positive conditional: 244, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 333, positive: 244, positive conditional: 5, positive unconditional: 239, negative: 89, negative conditional: 4, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 333, positive: 244, positive conditional: 5, positive unconditional: 239, negative: 89, negative conditional: 4, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, positive: 36, positive conditional: 1, positive unconditional: 35, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 123, negative conditional: 16, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 333, positive: 208, positive conditional: 4, positive unconditional: 204, negative: 80, negative conditional: 3, negative unconditional: 77, unknown: 45, unknown conditional: 2, unknown unconditional: 43] , Statistics on independence cache: Total cache size (in pairs): 1182, Positive cache size: 1133, Positive conditional cache size: 1, Positive unconditional cache size: 1132, Negative cache size: 49, Negative conditional cache size: 1, Negative unconditional cache size: 48, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1145.4ms, 37 PlacesBefore, 34 PlacesAfterwards, 31 TransitionsBefore, 29 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 531 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 231, positive: 201, positive conditional: 201, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 231, positive: 201, positive conditional: 18, positive unconditional: 183, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 231, positive: 201, positive conditional: 18, positive unconditional: 183, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 231, positive: 199, positive conditional: 18, positive unconditional: 181, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1135, Positive conditional cache size: 1, Positive unconditional cache size: 1134, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.0ms, 37 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 139 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, positive: 37, positive conditional: 2, positive unconditional: 35, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 37, positive conditional: 2, positive unconditional: 35, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, positive: 37, positive conditional: 2, positive unconditional: 35, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1135, Positive conditional cache size: 1, Positive unconditional cache size: 1134, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.7ms, 38 PlacesBefore, 38 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 58, positive: 51, positive conditional: 5, positive unconditional: 46, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 51, positive conditional: 5, positive unconditional: 46, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 50, positive conditional: 5, positive unconditional: 45, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1136, Positive conditional cache size: 1, Positive unconditional cache size: 1135, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.5ms, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, positive: 39, positive conditional: 5, positive unconditional: 34, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 39, positive conditional: 5, positive unconditional: 34, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 39, positive conditional: 5, positive unconditional: 34, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1136, Positive conditional cache size: 1, Positive unconditional cache size: 1135, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.4ms, 44 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 71 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1136, Positive conditional cache size: 1, Positive unconditional cache size: 1135, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.3ms, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 35 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1136, Positive conditional cache size: 1, Positive unconditional cache size: 1135, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.1ms, 49 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 127 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1188, Positive cache size: 1137, Positive conditional cache size: 2, Positive unconditional cache size: 1135, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.9ms, 53 PlacesBefore, 53 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 24 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, positive: 24, positive conditional: 21, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 24, positive conditional: 21, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 18, positive conditional: 15, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1194, Positive cache size: 1143, Positive conditional cache size: 8, Positive unconditional cache size: 1135, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.7ms, 57 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 496 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 22 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1198, Positive cache size: 1147, Positive conditional cache size: 12, Positive unconditional cache size: 1135, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3517.2ms, 59 PlacesBefore, 52 PlacesAfterwards, 40 TransitionsBefore, 35 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 52 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, positive: 52, positive conditional: 29, positive unconditional: 23, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 52, positive conditional: 29, positive unconditional: 23, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 6, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, positive: 43, positive conditional: 23, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1156, Positive conditional cache size: 18, Positive unconditional cache size: 1138, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 756.6ms, 50 PlacesBefore, 49 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 7, positive conditional: 4, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1208, Positive cache size: 1157, Positive conditional cache size: 18, Positive unconditional cache size: 1139, Negative cache size: 51, Negative conditional cache size: 1, Negative unconditional cache size: 50, Eliminated conditions: 4 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] 0 pthread_t t2030; [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18259.3ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1015.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7403.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 42 SDtfs, 28 SDslu, 19 SDs, 0 SdLazy, 232 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 226.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 313.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=10, InterpolantAutomatonStates: 54, 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: 28.3ms SsaConstructionTime, 285.6ms SatisfiabilityAnalysisTime, 693.9ms InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1030 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...