/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:15:40,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:15:40,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:15:40,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:15:40,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:15:40,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:15:40,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:15:40,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:15:40,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:15:40,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:15:40,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:15:40,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:15:40,484 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:15:40,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:15:40,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:15:40,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:15:40,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:15:40,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:15:40,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:15:40,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:15:40,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:15:40,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:15:40,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:15:40,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:15:40,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:15:40,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:15:40,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:15:40,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:15:40,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:15:40,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:15:40,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:15:40,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:15:40,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:15:40,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:15:40,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:15:40,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:15:40,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:15:40,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:15:40,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:15:40,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:15:40,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:15:40,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:15:40,541 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:15:40,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:15:40,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:15:40,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:15:40,545 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:15:40,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:15:40,545 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:15:40,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:15:40,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:15:40,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:15:40,546 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:15:40,546 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:15:40,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:15:40,546 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:15:40,547 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:15:40,547 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:15:40,547 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:15:40,547 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:15:40,547 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:15:40,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:15:40,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:15:40,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:15:40,548 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:15:40,548 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:15:40,548 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:15:40,548 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:15:40,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:15:40,548 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:15:40,549 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:15:40,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:15:40,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:15:40,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:15:40,871 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:15:40,871 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:15:40,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-03-11 20:15:40,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7471bdb/10d27201da2a4610bef33ec0eb86ff4e/FLAG92a9739e4 [2021-03-11 20:15:41,495 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:15:41,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2021-03-11 20:15:41,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7471bdb/10d27201da2a4610bef33ec0eb86ff4e/FLAG92a9739e4 [2021-03-11 20:15:41,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7471bdb/10d27201da2a4610bef33ec0eb86ff4e [2021-03-11 20:15:41,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:15:41,923 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:15:41,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:15:41,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:15:41,929 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:15:41,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:15:41" (1/1) ... [2021-03-11 20:15:41,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0c996c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:41, skipping insertion in model container [2021-03-11 20:15:41,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:15:41" (1/1) ... [2021-03-11 20:15:41,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:15:41,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:15:42,093 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/rfi000_pso.opt.i[948,961] [2021-03-11 20:15:42,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:15:42,235 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:15:42,245 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/rfi000_pso.opt.i[948,961] [2021-03-11 20:15:42,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:15:42,343 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:15:42,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42 WrapperNode [2021-03-11 20:15:42,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:15:42,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:15:42,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:15:42,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:15:42,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:15:42,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:15:42,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:15:42,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:15:42,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (1/1) ... [2021-03-11 20:15:42,446 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:15:42,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:15:42,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:15:42,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:15:42,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (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-11 20:15:42,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:15:42,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:15:42,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:15:42,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:15:42,522 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:15:42,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:15:42,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:15:42,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:15:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:15:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:15:42,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:15:42,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:15:42,527 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:15:43,948 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:15:43,948 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:15:43,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:15:43 BoogieIcfgContainer [2021-03-11 20:15:43,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:15:43,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:15:43,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:15:43,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:15:43,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:15:41" (1/3) ... [2021-03-11 20:15:43,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eeaf67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:15:43, skipping insertion in model container [2021-03-11 20:15:43,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:15:42" (2/3) ... [2021-03-11 20:15:43,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eeaf67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:15:43, skipping insertion in model container [2021-03-11 20:15:43,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:15:43" (3/3) ... [2021-03-11 20:15:43,957 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2021-03-11 20:15:43,963 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:15:43,966 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:15:43,967 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:15:43,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,998 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,998 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,998 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,998 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:43,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,002 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,002 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,002 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,003 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,003 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,003 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,003 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,004 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,008 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,009 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,009 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,031 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,032 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:15:44,033 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:15:44,048 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-11 20:15:44,066 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:15:44,066 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:15:44,066 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:15:44,066 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:15:44,066 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:15:44,066 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:15:44,067 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:15:44,067 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:15:44,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow [2021-03-11 20:15:44,125 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-11 20:15:44,125 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:15:44,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-11 20:15:44,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 83 transitions, 176 flow [2021-03-11 20:15:44,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 81 transitions, 168 flow [2021-03-11 20:15:44,142 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:15:44,149 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-11 20:15:44,154 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 81 transitions, 168 flow [2021-03-11 20:15:44,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 168 flow [2021-03-11 20:15:44,179 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-03-11 20:15:44,182 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:15:44,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-03-11 20:15:44,185 INFO L116 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-11 20:15:45,882 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 20:15:46,352 WARN L205 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-03-11 20:15:46,520 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-11 20:15:48,324 WARN L205 SmtUtils]: Spent 931.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-11 20:15:48,604 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-11 20:15:49,959 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-11 20:15:50,571 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 20:15:51,374 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-03-11 20:15:51,540 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2021-03-11 20:15:51,873 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-11 20:15:51,990 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-11 20:15:52,264 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-11 20:15:52,399 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-11 20:15:52,403 INFO L131 LiptonReduction]: Checked pairs total: 3005 [2021-03-11 20:15:52,403 INFO L133 LiptonReduction]: Total number of compositions: 72 [2021-03-11 20:15:52,404 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8265 [2021-03-11 20:15:52,413 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-03-11 20:15:52,414 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:15:52,414 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:52,414 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 20:15:52,415 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash 887242843, now seen corresponding path program 1 times [2021-03-11 20:15:52,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:52,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360239380] [2021-03-11 20:15:52,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:52,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:52,645 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-11 20:15:52,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360239380] [2021-03-11 20:15:52,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:52,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:15:52,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748922184] [2021-03-11 20:15:52,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:15:52,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:52,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:15:52,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:15:52,665 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 155 [2021-03-11 20:15:52,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 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-11 20:15:52,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:52,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 155 [2021-03-11 20:15:52,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:52,727 INFO L129 PetriNetUnfolder]: 16/62 cut-off events. [2021-03-11 20:15:52,727 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:15:52,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 62 events. 16/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 210 event pairs, 6 based on Foata normal form. 6/58 useless extension candidates. Maximal degree in co-relation 95. Up to 27 conditions per place. [2021-03-11 20:15:52,729 INFO L132 encePairwiseOnDemand]: 151/155 looper letters, 7 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-11 20:15:52,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 22 transitions, 68 flow [2021-03-11 20:15:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:15:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:15:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2021-03-11 20:15:52,747 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8516129032258064 [2021-03-11 20:15:52,748 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2021-03-11 20:15:52,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2021-03-11 20:15:52,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:52,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2021-03-11 20:15:52,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 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-11 20:15:52,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 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-11 20:15:52,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 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-11 20:15:52,764 INFO L185 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 396 transitions. [2021-03-11 20:15:52,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 22 transitions, 68 flow [2021-03-11 20:15:52,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:15:52,767 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 46 flow [2021-03-11 20:15:52,768 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2021-03-11 20:15:52,768 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2021-03-11 20:15:52,769 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 46 flow [2021-03-11 20:15:52,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 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-11 20:15:52,769 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:52,769 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:52,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:15:52,769 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:52,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash 624883219, now seen corresponding path program 1 times [2021-03-11 20:15:52,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:52,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196818430] [2021-03-11 20:15:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:52,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 20:15:52,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:15:52,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:52,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:52,904 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-11 20:15:52,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196818430] [2021-03-11 20:15:52,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:52,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:15:52,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823963769] [2021-03-11 20:15:52,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:15:52,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:52,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:15:52,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:15:52,908 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 155 [2021-03-11 20:15:52,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 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-11 20:15:52,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:52,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 155 [2021-03-11 20:15:52,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:53,050 INFO L129 PetriNetUnfolder]: 157/348 cut-off events. [2021-03-11 20:15:53,050 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:15:53,051 INFO L84 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 348 events. 157/348 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1944 event pairs, 33 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 651. Up to 106 conditions per place. [2021-03-11 20:15:53,053 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 14 selfloop transitions, 5 changer transitions 19/46 dead transitions. [2021-03-11 20:15:53,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 46 transitions, 176 flow [2021-03-11 20:15:53,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:15:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:15:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 790 transitions. [2021-03-11 20:15:53,056 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.728110599078341 [2021-03-11 20:15:53,057 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 790 transitions. [2021-03-11 20:15:53,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 790 transitions. [2021-03-11 20:15:53,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:53,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 790 transitions. [2021-03-11 20:15:53,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 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-11 20:15:53,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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-11 20:15:53,063 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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-11 20:15:53,063 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 46 flow. Second operand 7 states and 790 transitions. [2021-03-11 20:15:53,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 46 transitions, 176 flow [2021-03-11 20:15:53,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:15:53,065 INFO L241 Difference]: Finished difference. Result has 35 places, 20 transitions, 70 flow [2021-03-11 20:15:53,065 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2021-03-11 20:15:53,066 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2021-03-11 20:15:53,066 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 70 flow [2021-03-11 20:15:53,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 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-11 20:15:53,067 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:53,067 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:53,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:15:53,070 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:53,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:53,071 INFO L82 PathProgramCache]: Analyzing trace with hash 376470425, now seen corresponding path program 1 times [2021-03-11 20:15:53,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:53,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020992434] [2021-03-11 20:15:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:53,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:53,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:53,229 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-11 20:15:53,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020992434] [2021-03-11 20:15:53,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:53,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:15:53,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766340132] [2021-03-11 20:15:53,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:15:53,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:53,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:15:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:15:53,232 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 155 [2021-03-11 20:15:53,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 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-11 20:15:53,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:53,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 155 [2021-03-11 20:15:53,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:53,261 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-03-11 20:15:53,262 INFO L130 PetriNetUnfolder]: For 34/35 co-relation queries the response was YES. [2021-03-11 20:15:53,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 38 events. 0/38 cut-off events. For 34/35 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 99 event pairs, 0 based on Foata normal form. 4/42 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2021-03-11 20:15:53,263 INFO L132 encePairwiseOnDemand]: 151/155 looper letters, 2 selfloop transitions, 2 changer transitions 4/22 dead transitions. [2021-03-11 20:15:53,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 22 transitions, 90 flow [2021-03-11 20:15:53,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:15:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:15:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 633 transitions. [2021-03-11 20:15:53,265 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8167741935483871 [2021-03-11 20:15:53,265 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 633 transitions. [2021-03-11 20:15:53,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 633 transitions. [2021-03-11 20:15:53,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:53,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 633 transitions. [2021-03-11 20:15:53,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 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-11 20:15:53,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 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-11 20:15:53,269 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 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-11 20:15:53,269 INFO L185 Difference]: Start difference. First operand has 35 places, 20 transitions, 70 flow. Second operand 5 states and 633 transitions. [2021-03-11 20:15:53,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 22 transitions, 90 flow [2021-03-11 20:15:53,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 84 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-11 20:15:53,271 INFO L241 Difference]: Finished difference. Result has 35 places, 18 transitions, 66 flow [2021-03-11 20:15:53,271 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=35, PETRI_TRANSITIONS=18} [2021-03-11 20:15:53,272 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2021-03-11 20:15:53,272 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 66 flow [2021-03-11 20:15:53,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 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-11 20:15:53,272 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:53,272 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:53,272 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:15:53,273 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:53,273 INFO L82 PathProgramCache]: Analyzing trace with hash -570957278, now seen corresponding path program 1 times [2021-03-11 20:15:53,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:53,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888636268] [2021-03-11 20:15:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:53,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:15:53,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:15:53,363 INFO L142 QuantifierPusher]: treesize reduction 10, result has 56.5 percent of original size [2021-03-11 20:15:53,364 INFO L147 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size 9 [2021-03-11 20:15:53,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:53,382 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-11 20:15:53,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888636268] [2021-03-11 20:15:53,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:53,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:15:53,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971616211] [2021-03-11 20:15:53,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:15:53,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:53,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:15:53,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:15:53,384 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 155 [2021-03-11 20:15:53,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 18 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 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-11 20:15:53,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:53,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 155 [2021-03-11 20:15:53,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:53,477 INFO L129 PetriNetUnfolder]: 21/71 cut-off events. [2021-03-11 20:15:53,478 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2021-03-11 20:15:53,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 71 events. 21/71 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 233 event pairs, 11 based on Foata normal form. 6/77 useless extension candidates. Maximal degree in co-relation 157. Up to 33 conditions per place. [2021-03-11 20:15:53,478 INFO L132 encePairwiseOnDemand]: 149/155 looper letters, 7 selfloop transitions, 5 changer transitions 7/29 dead transitions. [2021-03-11 20:15:53,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 138 flow [2021-03-11 20:15:53,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:15:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:15:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2021-03-11 20:15:53,481 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7235023041474654 [2021-03-11 20:15:53,482 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2021-03-11 20:15:53,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2021-03-11 20:15:53,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:53,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2021-03-11 20:15:53,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 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-11 20:15:53,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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-11 20:15:53,487 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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-11 20:15:53,487 INFO L185 Difference]: Start difference. First operand has 35 places, 18 transitions, 66 flow. Second operand 7 states and 785 transitions. [2021-03-11 20:15:53,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 138 flow [2021-03-11 20:15:53,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 116 flow, removed 5 selfloop flow, removed 8 redundant places. [2021-03-11 20:15:53,488 INFO L241 Difference]: Finished difference. Result has 36 places, 20 transitions, 83 flow [2021-03-11 20:15:53,489 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=83, PETRI_PLACES=36, PETRI_TRANSITIONS=20} [2021-03-11 20:15:53,489 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 9 predicate places. [2021-03-11 20:15:53,489 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 83 flow [2021-03-11 20:15:53,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 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-11 20:15:53,489 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:53,489 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:53,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:15:53,490 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:53,490 INFO L82 PathProgramCache]: Analyzing trace with hash 756159698, now seen corresponding path program 1 times [2021-03-11 20:15:53,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:53,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57898391] [2021-03-11 20:15:53,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:53,595 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-11 20:15:53,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 20:15:53,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:15:53,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:15:53,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:53,650 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-11 20:15:53,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57898391] [2021-03-11 20:15:53,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:53,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:15:53,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121883867] [2021-03-11 20:15:53,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:15:53,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:53,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:15:53,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:15:53,654 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 155 [2021-03-11 20:15:53,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 83 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 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-11 20:15:53,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:53,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 155 [2021-03-11 20:15:53,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:53,770 INFO L129 PetriNetUnfolder]: 25/83 cut-off events. [2021-03-11 20:15:53,770 INFO L130 PetriNetUnfolder]: For 124/126 co-relation queries the response was YES. [2021-03-11 20:15:53,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 83 events. 25/83 cut-off events. For 124/126 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 270 event pairs, 11 based on Foata normal form. 8/91 useless extension candidates. Maximal degree in co-relation 218. Up to 43 conditions per place. [2021-03-11 20:15:53,772 INFO L132 encePairwiseOnDemand]: 149/155 looper letters, 9 selfloop transitions, 4 changer transitions 6/30 dead transitions. [2021-03-11 20:15:53,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 153 flow [2021-03-11 20:15:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:15:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:15:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 644 transitions. [2021-03-11 20:15:53,775 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6924731182795699 [2021-03-11 20:15:53,775 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 644 transitions. [2021-03-11 20:15:53,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 644 transitions. [2021-03-11 20:15:53,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:53,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 644 transitions. [2021-03-11 20:15:53,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 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-11 20:15:53,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 155.0) internal successors, (1085), 7 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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-11 20:15:53,780 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 155.0) internal successors, (1085), 7 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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-11 20:15:53,780 INFO L185 Difference]: Start difference. First operand has 36 places, 20 transitions, 83 flow. Second operand 6 states and 644 transitions. [2021-03-11 20:15:53,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 153 flow [2021-03-11 20:15:53,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 146 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-11 20:15:53,783 INFO L241 Difference]: Finished difference. Result has 38 places, 22 transitions, 105 flow [2021-03-11 20:15:53,784 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2021-03-11 20:15:53,784 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2021-03-11 20:15:53,784 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 105 flow [2021-03-11 20:15:53,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 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-11 20:15:53,784 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:53,784 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:53,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:15:53,785 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:53,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1966038650, now seen corresponding path program 1 times [2021-03-11 20:15:53,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:53,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221200729] [2021-03-11 20:15:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:53,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:15:53,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:15:53,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:15:53,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:15:53,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:53,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:53,889 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-11 20:15:53,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221200729] [2021-03-11 20:15:53,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:53,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:15:53,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056220940] [2021-03-11 20:15:53,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:15:53,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:53,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:15:53,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:15:53,892 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 155 [2021-03-11 20:15:53,892 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 22 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 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-11 20:15:53,892 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:53,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 155 [2021-03-11 20:15:53,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:53,980 INFO L129 PetriNetUnfolder]: 29/90 cut-off events. [2021-03-11 20:15:53,980 INFO L130 PetriNetUnfolder]: For 200/207 co-relation queries the response was YES. [2021-03-11 20:15:53,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 90 events. 29/90 cut-off events. For 200/207 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 303 event pairs, 3 based on Foata normal form. 11/101 useless extension candidates. Maximal degree in co-relation 294. Up to 47 conditions per place. [2021-03-11 20:15:53,983 INFO L132 encePairwiseOnDemand]: 147/155 looper letters, 9 selfloop transitions, 8 changer transitions 3/31 dead transitions. [2021-03-11 20:15:53,983 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 199 flow [2021-03-11 20:15:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:15:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:15:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 647 transitions. [2021-03-11 20:15:53,986 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6956989247311828 [2021-03-11 20:15:53,986 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 647 transitions. [2021-03-11 20:15:53,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 647 transitions. [2021-03-11 20:15:53,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:53,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 647 transitions. [2021-03-11 20:15:53,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 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-11 20:15:53,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 155.0) internal successors, (1085), 7 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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-11 20:15:53,990 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 155.0) internal successors, (1085), 7 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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-11 20:15:53,990 INFO L185 Difference]: Start difference. First operand has 38 places, 22 transitions, 105 flow. Second operand 6 states and 647 transitions. [2021-03-11 20:15:53,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 199 flow [2021-03-11 20:15:53,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 190 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-11 20:15:53,994 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 152 flow [2021-03-11 20:15:53,994 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-03-11 20:15:53,995 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2021-03-11 20:15:53,995 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 152 flow [2021-03-11 20:15:53,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 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-11 20:15:53,995 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:53,995 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:53,995 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:15:53,995 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:53,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1965097831, now seen corresponding path program 1 times [2021-03-11 20:15:53,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:53,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380916174] [2021-03-11 20:15:53,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:54,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:54,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:15:54,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:15:54,066 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-11 20:15:54,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380916174] [2021-03-11 20:15:54,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:54,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:15:54,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935400202] [2021-03-11 20:15:54,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:15:54,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:54,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:15:54,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:15:54,068 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 155 [2021-03-11 20:15:54,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 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-11 20:15:54,068 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:54,068 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 155 [2021-03-11 20:15:54,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:54,098 INFO L129 PetriNetUnfolder]: 20/75 cut-off events. [2021-03-11 20:15:54,098 INFO L130 PetriNetUnfolder]: For 149/159 co-relation queries the response was YES. [2021-03-11 20:15:54,098 INFO L84 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 75 events. 20/75 cut-off events. For 149/159 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 230 event pairs, 6 based on Foata normal form. 24/98 useless extension candidates. Maximal degree in co-relation 241. Up to 29 conditions per place. [2021-03-11 20:15:54,098 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 5 selfloop transitions, 6 changer transitions 2/32 dead transitions. [2021-03-11 20:15:54,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 184 flow [2021-03-11 20:15:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:15:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:15:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2021-03-11 20:15:54,101 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8051612903225807 [2021-03-11 20:15:54,101 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2021-03-11 20:15:54,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2021-03-11 20:15:54,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:54,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2021-03-11 20:15:54,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 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-11 20:15:54,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 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-11 20:15:54,104 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 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-11 20:15:54,105 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 152 flow. Second operand 5 states and 624 transitions. [2021-03-11 20:15:54,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 184 flow [2021-03-11 20:15:54,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 170 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 20:15:54,108 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 175 flow [2021-03-11 20:15:54,108 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2021-03-11 20:15:54,108 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2021-03-11 20:15:54,108 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 175 flow [2021-03-11 20:15:54,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 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-11 20:15:54,109 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:54,109 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:54,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:15:54,109 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:54,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:54,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1427865755, now seen corresponding path program 1 times [2021-03-11 20:15:54,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:54,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846716645] [2021-03-11 20:15:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:54,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:54,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:54,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:15:54,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:15:54,190 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-11 20:15:54,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846716645] [2021-03-11 20:15:54,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:54,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:15:54,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242710204] [2021-03-11 20:15:54,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:15:54,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:54,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:15:54,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:15:54,193 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 155 [2021-03-11 20:15:54,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 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-11 20:15:54,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:54,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 155 [2021-03-11 20:15:54,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:54,239 INFO L129 PetriNetUnfolder]: 5/43 cut-off events. [2021-03-11 20:15:54,240 INFO L130 PetriNetUnfolder]: For 120/155 co-relation queries the response was YES. [2021-03-11 20:15:54,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 43 events. 5/43 cut-off events. For 120/155 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 105 event pairs, 0 based on Foata normal form. 38/81 useless extension candidates. Maximal degree in co-relation 139. Up to 13 conditions per place. [2021-03-11 20:15:54,240 INFO L132 encePairwiseOnDemand]: 150/155 looper letters, 2 selfloop transitions, 9 changer transitions 2/32 dead transitions. [2021-03-11 20:15:54,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 32 transitions, 205 flow [2021-03-11 20:15:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:15:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:15:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2021-03-11 20:15:54,243 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8009216589861751 [2021-03-11 20:15:54,243 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2021-03-11 20:15:54,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2021-03-11 20:15:54,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:54,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2021-03-11 20:15:54,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 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-11 20:15:54,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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-11 20:15:54,248 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 155.0) internal successors, (1240), 8 states have internal predecessors, (1240), 0 states have call successors, (0), 0 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-11 20:15:54,248 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 175 flow. Second operand 7 states and 869 transitions. [2021-03-11 20:15:54,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 32 transitions, 205 flow [2021-03-11 20:15:54,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 171 flow, removed 13 selfloop flow, removed 5 redundant places. [2021-03-11 20:15:54,251 INFO L241 Difference]: Finished difference. Result has 46 places, 30 transitions, 169 flow [2021-03-11 20:15:54,251 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=169, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2021-03-11 20:15:54,251 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 19 predicate places. [2021-03-11 20:15:54,251 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 169 flow [2021-03-11 20:15:54,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 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-11 20:15:54,251 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:54,251 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:54,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:15:54,252 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:54,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1643652467, now seen corresponding path program 1 times [2021-03-11 20:15:54,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:54,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887022401] [2021-03-11 20:15:54,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:15:54,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:15:54,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:54,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:15:54,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:15:54,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:15:54,342 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-11 20:15:54,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887022401] [2021-03-11 20:15:54,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:15:54,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:15:54,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185492962] [2021-03-11 20:15:54,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:15:54,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:15:54,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:15:54,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:15:54,344 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 155 [2021-03-11 20:15:54,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 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-11 20:15:54,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:15:54,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 155 [2021-03-11 20:15:54,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:15:54,392 INFO L129 PetriNetUnfolder]: 9/74 cut-off events. [2021-03-11 20:15:54,392 INFO L130 PetriNetUnfolder]: For 177/190 co-relation queries the response was YES. [2021-03-11 20:15:54,393 INFO L84 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 74 events. 9/74 cut-off events. For 177/190 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 291 event pairs, 0 based on Foata normal form. 11/85 useless extension candidates. Maximal degree in co-relation 240. Up to 22 conditions per place. [2021-03-11 20:15:54,394 INFO L132 encePairwiseOnDemand]: 151/155 looper letters, 8 selfloop transitions, 1 changer transitions 4/35 dead transitions. [2021-03-11 20:15:54,394 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 35 transitions, 210 flow [2021-03-11 20:15:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:15:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:15:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2021-03-11 20:15:54,396 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7638709677419355 [2021-03-11 20:15:54,397 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2021-03-11 20:15:54,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2021-03-11 20:15:54,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:15:54,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2021-03-11 20:15:54,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 0 states have call successors, (0), 0 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-11 20:15:54,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 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-11 20:15:54,401 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 155.0) internal successors, (930), 6 states have internal predecessors, (930), 0 states have call successors, (0), 0 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-11 20:15:54,401 INFO L185 Difference]: Start difference. First operand has 46 places, 30 transitions, 169 flow. Second operand 5 states and 592 transitions. [2021-03-11 20:15:54,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 35 transitions, 210 flow [2021-03-11 20:15:54,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 185 flow, removed 5 selfloop flow, removed 6 redundant places. [2021-03-11 20:15:54,404 INFO L241 Difference]: Finished difference. Result has 46 places, 30 transitions, 153 flow [2021-03-11 20:15:54,404 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=155, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2021-03-11 20:15:54,404 INFO L335 CegarLoopForPetriNet]: 27 programPoint places, 19 predicate places. [2021-03-11 20:15:54,405 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 153 flow [2021-03-11 20:15:54,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 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-11 20:15:54,405 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:15:54,405 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:15:54,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:15:54,405 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:15:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:15:54,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1057249741, now seen corresponding path program 2 times [2021-03-11 20:15:54,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:15:54,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400218041] [2021-03-11 20:15:54,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:15:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:15:54,448 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:15:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:15:54,502 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:15:54,540 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:15:54,541 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:15:54,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:15:54,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:15:54 BasicIcfg [2021-03-11 20:15:54,593 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:15:54,594 INFO L168 Benchmark]: Toolchain (without parser) took 12673.98 ms. Allocated memory was 255.9 MB in the beginning and 576.7 MB in the end (delta: 320.9 MB). Free memory was 233.2 MB in the beginning and 399.0 MB in the end (delta: -165.8 MB). Peak memory consumption was 154.6 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:54,598 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:15:54,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.05 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 232.7 MB in the beginning and 329.0 MB in the end (delta: -96.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:54,598 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.10 ms. Allocated memory is still 369.1 MB. Free memory was 329.0 MB in the beginning and 326.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:54,599 INFO L168 Benchmark]: Boogie Preprocessor took 41.60 ms. Allocated memory is still 369.1 MB. Free memory was 326.1 MB in the beginning and 323.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:54,599 INFO L168 Benchmark]: RCFGBuilder took 1493.64 ms. Allocated memory is still 369.1 MB. Free memory was 323.9 MB in the beginning and 277.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 47.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:54,599 INFO L168 Benchmark]: TraceAbstraction took 10640.49 ms. Allocated memory was 369.1 MB in the beginning and 576.7 MB in the end (delta: 207.6 MB). Free memory was 276.1 MB in the beginning and 399.0 MB in the end (delta: -123.0 MB). Peak memory consumption was 84.6 MB. Max. memory is 16.0 GB. [2021-03-11 20:15:54,601 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.11 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 418.05 ms. Allocated memory was 255.9 MB in the beginning and 369.1 MB in the end (delta: 113.2 MB). Free memory was 232.7 MB in the beginning and 329.0 MB in the end (delta: -96.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 59.10 ms. Allocated memory is still 369.1 MB. Free memory was 329.0 MB in the beginning and 326.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 41.60 ms. Allocated memory is still 369.1 MB. Free memory was 326.1 MB in the beginning and 323.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1493.64 ms. Allocated memory is still 369.1 MB. Free memory was 323.9 MB in the beginning and 277.1 MB in the end (delta: 46.8 MB). Peak memory consumption was 47.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 10640.49 ms. Allocated memory was 369.1 MB in the beginning and 576.7 MB in the end (delta: 207.6 MB). Free memory was 276.1 MB in the beginning and 399.0 MB in the end (delta: -123.0 MB). Peak memory consumption was 84.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8249.1ms, 86 PlacesBefore, 27 PlacesAfterwards, 81 TransitionsBefore, 21 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 3005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1192, positive: 1055, positive conditional: 0, positive unconditional: 1055, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 740, positive: 697, positive conditional: 0, positive unconditional: 697, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 740, positive: 680, positive conditional: 0, positive unconditional: 680, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 880, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 850, negative conditional: 0, negative unconditional: 850, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1192, positive: 358, positive conditional: 0, positive unconditional: 358, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 740, unknown conditional: 0, unknown unconditional: 740] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [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$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1591; [L801] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L802] 0 pthread_t t1592; [L803] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L775] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L738] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] [L778] 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) [L778] 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) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 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 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 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 [L744] 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) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] 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) [L744] 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) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 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 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 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 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L809] 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) [L809] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L809] 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) [L809] 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) [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 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 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L813] 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 [L816] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 0 x$flush_delayed = weak$$choice2 [L819] 0 x$mem_tmp = x [L820] 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) [L820] 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) [L821] 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)) [L821] EXPR 0 !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) [L821] 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)) [L821] 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)) [L822] 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)) [L822] EXPR 0 !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) [L822] 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)) [L822] 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)) [L823] 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)) [L823] EXPR 0 !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) [L823] 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)) [L823] 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)) [L824] 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)) [L824] EXPR 0 !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) [L824] 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)) [L824] 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)) [L825] 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)) [L825] EXPR 0 !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) [L825] 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)) [L825] 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)) [L826] 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)) [L826] EXPR 0 !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) [L826] 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)) [L826] 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)) [L827] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L828] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L828] 0 x = x$flush_delayed ? x$mem_tmp : x [L829] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10479.0ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 811.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8344.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 50 SDtfs, 54 SDslu, 58 SDs, 0 SdLazy, 213 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 255.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 275.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=7, InterpolantAutomatonStates: 51, 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: 34.9ms SsaConstructionTime, 442.4ms SatisfiabilityAnalysisTime, 559.0ms InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...