/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:28:26,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:28:26,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:28:26,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:28:26,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:28:26,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:28:26,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:28:26,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:28:26,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:28:26,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:28:26,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:28:26,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:28:26,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:28:26,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:28:26,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:28:26,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:28:26,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:28:26,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:28:26,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:28:26,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:28:26,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:28:26,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:28:26,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:28:26,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:28:26,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:28:26,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:28:26,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:28:26,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:28:26,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:28:26,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:28:26,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:28:26,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:28:26,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:28:26,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:28:26,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:28:26,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:28:26,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:28:26,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:28:26,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:28:26,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:28:26,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:28:26,679 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:28:26,705 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:28:26,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:28:26,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:28:26,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:28:26,708 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:28:26,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:28:26,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:28:26,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:28:26,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:28:26,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:28:26,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:28:26,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:28:26,710 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:28:26,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:28:26,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:28:26,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:28:26,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:28:26,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:28:26,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:28:26,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:28:26,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:28:26,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:28:26,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:28:26,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:28:26,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:28:26,713 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-bitabs/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 [2020-12-23 09:28:27,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:28:27,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:28:27,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:28:27,177 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:28:27,180 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:28:27,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2020-12-23 09:28:27,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/82da4e537/e274e096805d4d34a04ad01c56f159a4/FLAGe7d77e4b6 [2020-12-23 09:28:27,979 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:28:27,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2020-12-23 09:28:27,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/82da4e537/e274e096805d4d34a04ad01c56f159a4/FLAGe7d77e4b6 [2020-12-23 09:28:28,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/82da4e537/e274e096805d4d34a04ad01c56f159a4 [2020-12-23 09:28:28,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:28:28,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:28:28,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:28:28,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:28:28,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:28:28,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c8cc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28, skipping insertion in model container [2020-12-23 09:28:28,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:28:28,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:28:28,519 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~b0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~b0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] [2020-12-23 09:28:28,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:28:28,603 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:28:28,621 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c[334,347] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s1~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s3~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~s2~0,] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~b0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~b0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_val~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d0_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_val_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d1_req_up~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~comp_m1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] [2020-12-23 09:28:28,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:28:28,741 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:28:28,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28 WrapperNode [2020-12-23 09:28:28,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:28:28,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:28:28,744 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:28:28,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:28:28,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,765 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:28:28,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:28:28,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:28:28,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:28:28,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (1/1) ... [2020-12-23 09:28:28,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:28:28,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:28:28,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:28:28,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:28:28,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 09:28:29,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:28:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:28:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:28:29,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:28:29,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:28:29,905 INFO L299 CfgBuilder]: Removed 64 assume(true) statements. [2020-12-23 09:28:29,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:28:29 BoogieIcfgContainer [2020-12-23 09:28:29,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:28:29,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:28:29,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:28:29,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:28:29,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:28:28" (1/3) ... [2020-12-23 09:28:29,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575e1c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:28:29, skipping insertion in model container [2020-12-23 09:28:29,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:28:28" (2/3) ... [2020-12-23 09:28:29,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575e1c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:28:29, skipping insertion in model container [2020-12-23 09:28:29,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:28:29" (3/3) ... [2020-12-23 09:28:29,918 INFO L111 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2020-12-23 09:28:29,932 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:28:29,942 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:28:29,983 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:28:30,069 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:28:30,070 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:28:30,073 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:28:30,073 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:28:30,074 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:28:30,074 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:28:30,074 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:28:30,074 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:28:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2020-12-23 09:28:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 09:28:30,129 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:30,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:30,131 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:30,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:30,138 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2020-12-23 09:28:30,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:30,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431090988] [2020-12-23 09:28:30,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:30,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431090988] [2020-12-23 09:28:30,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:30,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:30,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789105122] [2020-12-23 09:28:30,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:30,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:30,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:30,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:30,373 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2020-12-23 09:28:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:30,474 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2020-12-23 09:28:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:30,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-23 09:28:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:30,490 INFO L225 Difference]: With dead ends: 210 [2020-12-23 09:28:30,491 INFO L226 Difference]: Without dead ends: 104 [2020-12-23 09:28:30,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-23 09:28:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-12-23 09:28:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-23 09:28:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2020-12-23 09:28:30,546 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2020-12-23 09:28:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:30,546 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2020-12-23 09:28:30,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2020-12-23 09:28:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 09:28:30,550 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:30,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:30,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:28:30,551 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:30,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:30,552 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2020-12-23 09:28:30,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:30,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137807543] [2020-12-23 09:28:30,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:30,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:30,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137807543] [2020-12-23 09:28:30,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:30,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:30,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448334214] [2020-12-23 09:28:30,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:30,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:30,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:30,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:30,713 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2020-12-23 09:28:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:30,770 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2020-12-23 09:28:30,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:30,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2020-12-23 09:28:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:30,777 INFO L225 Difference]: With dead ends: 199 [2020-12-23 09:28:30,777 INFO L226 Difference]: Without dead ends: 104 [2020-12-23 09:28:30,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-23 09:28:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-12-23 09:28:30,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-23 09:28:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2020-12-23 09:28:30,810 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2020-12-23 09:28:30,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:30,813 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2020-12-23 09:28:30,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2020-12-23 09:28:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-23 09:28:30,819 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:30,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:30,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:28:30,824 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:30,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:30,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2020-12-23 09:28:30,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:30,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635547978] [2020-12-23 09:28:30,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:30,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635547978] [2020-12-23 09:28:30,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:30,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:30,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733771671] [2020-12-23 09:28:30,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:30,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:30,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:30,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:30,935 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2020-12-23 09:28:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:30,957 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2020-12-23 09:28:30,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:30,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2020-12-23 09:28:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:30,960 INFO L225 Difference]: With dead ends: 196 [2020-12-23 09:28:30,960 INFO L226 Difference]: Without dead ends: 104 [2020-12-23 09:28:30,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-23 09:28:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-12-23 09:28:30,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-23 09:28:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2020-12-23 09:28:30,978 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2020-12-23 09:28:30,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:30,979 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2020-12-23 09:28:30,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2020-12-23 09:28:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-23 09:28:30,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:30,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:30,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:28:30,982 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:30,982 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2020-12-23 09:28:30,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:30,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907262241] [2020-12-23 09:28:30,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:31,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:31,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907262241] [2020-12-23 09:28:31,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:31,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:31,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34836208] [2020-12-23 09:28:31,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:31,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:31,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:31,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:31,106 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2020-12-23 09:28:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:31,140 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2020-12-23 09:28:31,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:31,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2020-12-23 09:28:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:31,144 INFO L225 Difference]: With dead ends: 193 [2020-12-23 09:28:31,144 INFO L226 Difference]: Without dead ends: 104 [2020-12-23 09:28:31,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-12-23 09:28:31,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-12-23 09:28:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-12-23 09:28:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2020-12-23 09:28:31,170 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2020-12-23 09:28:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:31,170 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2020-12-23 09:28:31,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2020-12-23 09:28:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 09:28:31,173 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:31,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:31,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:28:31,176 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:31,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:31,177 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2020-12-23 09:28:31,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:31,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774839754] [2020-12-23 09:28:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:31,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774839754] [2020-12-23 09:28:31,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:31,317 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:31,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640029491] [2020-12-23 09:28:31,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:31,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:31,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:31,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:31,319 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2020-12-23 09:28:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:31,360 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2020-12-23 09:28:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:31,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-23 09:28:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:31,363 INFO L225 Difference]: With dead ends: 271 [2020-12-23 09:28:31,363 INFO L226 Difference]: Without dead ends: 191 [2020-12-23 09:28:31,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-23 09:28:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2020-12-23 09:28:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-12-23 09:28:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2020-12-23 09:28:31,382 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2020-12-23 09:28:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:31,382 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2020-12-23 09:28:31,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2020-12-23 09:28:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 09:28:31,385 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:31,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:31,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:28:31,386 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:31,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2020-12-23 09:28:31,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:31,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646142224] [2020-12-23 09:28:31,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:31,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646142224] [2020-12-23 09:28:31,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:31,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:28:31,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941655905] [2020-12-23 09:28:31,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:28:31,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:31,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:28:31,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:28:31,527 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 6 states. [2020-12-23 09:28:31,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:31,628 INFO L93 Difference]: Finished difference Result 444 states and 708 transitions. [2020-12-23 09:28:31,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:28:31,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-12-23 09:28:31,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:31,631 INFO L225 Difference]: With dead ends: 444 [2020-12-23 09:28:31,631 INFO L226 Difference]: Without dead ends: 261 [2020-12-23 09:28:31,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:28:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-12-23 09:28:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 194. [2020-12-23 09:28:31,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-12-23 09:28:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 310 transitions. [2020-12-23 09:28:31,651 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 310 transitions. Word has length 72 [2020-12-23 09:28:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:31,651 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 310 transitions. [2020-12-23 09:28:31,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:28:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 310 transitions. [2020-12-23 09:28:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 09:28:31,653 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:31,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:31,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:28:31,654 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:31,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:31,655 INFO L82 PathProgramCache]: Analyzing trace with hash -333833310, now seen corresponding path program 1 times [2020-12-23 09:28:31,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:31,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347536261] [2020-12-23 09:28:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:31,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347536261] [2020-12-23 09:28:31,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:31,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:31,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786593814] [2020-12-23 09:28:31,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:31,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:31,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:31,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:31,714 INFO L87 Difference]: Start difference. First operand 194 states and 310 transitions. Second operand 3 states. [2020-12-23 09:28:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:31,750 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2020-12-23 09:28:31,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:31,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2020-12-23 09:28:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:31,753 INFO L225 Difference]: With dead ends: 408 [2020-12-23 09:28:31,753 INFO L226 Difference]: Without dead ends: 271 [2020-12-23 09:28:31,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:31,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2020-12-23 09:28:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2020-12-23 09:28:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-12-23 09:28:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 425 transitions. [2020-12-23 09:28:31,778 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 425 transitions. Word has length 72 [2020-12-23 09:28:31,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:31,778 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 425 transitions. [2020-12-23 09:28:31,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 425 transitions. [2020-12-23 09:28:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-12-23 09:28:31,785 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:31,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:31,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:28:31,786 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1594439392, now seen corresponding path program 1 times [2020-12-23 09:28:31,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:31,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849733800] [2020-12-23 09:28:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:31,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849733800] [2020-12-23 09:28:31,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:31,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:28:31,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734522112] [2020-12-23 09:28:31,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:28:31,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:31,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:28:31,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:31,914 INFO L87 Difference]: Start difference. First operand 268 states and 425 transitions. Second operand 5 states. [2020-12-23 09:28:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:31,991 INFO L93 Difference]: Finished difference Result 622 states and 975 transitions. [2020-12-23 09:28:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:28:31,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2020-12-23 09:28:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:31,995 INFO L225 Difference]: With dead ends: 622 [2020-12-23 09:28:31,995 INFO L226 Difference]: Without dead ends: 427 [2020-12-23 09:28:31,996 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:28:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-12-23 09:28:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 280. [2020-12-23 09:28:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-12-23 09:28:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 437 transitions. [2020-12-23 09:28:32,013 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 437 transitions. Word has length 72 [2020-12-23 09:28:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:32,014 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 437 transitions. [2020-12-23 09:28:32,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:28:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 437 transitions. [2020-12-23 09:28:32,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 09:28:32,015 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:32,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:32,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:28:32,016 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:32,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:32,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1043865723, now seen corresponding path program 1 times [2020-12-23 09:28:32,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:32,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041895373] [2020-12-23 09:28:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:32,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041895373] [2020-12-23 09:28:32,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:32,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:32,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643363297] [2020-12-23 09:28:32,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:32,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:32,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:32,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:32,056 INFO L87 Difference]: Start difference. First operand 280 states and 437 transitions. Second operand 3 states. [2020-12-23 09:28:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:32,093 INFO L93 Difference]: Finished difference Result 563 states and 879 transitions. [2020-12-23 09:28:32,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:32,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-12-23 09:28:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:32,096 INFO L225 Difference]: With dead ends: 563 [2020-12-23 09:28:32,096 INFO L226 Difference]: Without dead ends: 332 [2020-12-23 09:28:32,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-12-23 09:28:32,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2020-12-23 09:28:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-12-23 09:28:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 491 transitions. [2020-12-23 09:28:32,112 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 491 transitions. Word has length 75 [2020-12-23 09:28:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:32,112 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 491 transitions. [2020-12-23 09:28:32,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 491 transitions. [2020-12-23 09:28:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-12-23 09:28:32,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:32,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:32,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:28:32,114 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:32,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1477594809, now seen corresponding path program 1 times [2020-12-23 09:28:32,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:32,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063198049] [2020-12-23 09:28:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:32,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063198049] [2020-12-23 09:28:32,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:32,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:32,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631034517] [2020-12-23 09:28:32,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:32,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:32,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:32,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:32,169 INFO L87 Difference]: Start difference. First operand 320 states and 491 transitions. Second operand 3 states. [2020-12-23 09:28:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:32,207 INFO L93 Difference]: Finished difference Result 567 states and 864 transitions. [2020-12-23 09:28:32,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:32,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2020-12-23 09:28:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:32,210 INFO L225 Difference]: With dead ends: 567 [2020-12-23 09:28:32,210 INFO L226 Difference]: Without dead ends: 284 [2020-12-23 09:28:32,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:32,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-12-23 09:28:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2020-12-23 09:28:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-23 09:28:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2020-12-23 09:28:32,225 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 75 [2020-12-23 09:28:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:32,225 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2020-12-23 09:28:32,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2020-12-23 09:28:32,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-23 09:28:32,226 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:32,227 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:32,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:28:32,227 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:32,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:32,228 INFO L82 PathProgramCache]: Analyzing trace with hash 969577782, now seen corresponding path program 1 times [2020-12-23 09:28:32,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:32,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868147372] [2020-12-23 09:28:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:32,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868147372] [2020-12-23 09:28:32,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:32,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:28:32,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699456679] [2020-12-23 09:28:32,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:28:32,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:32,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:28:32,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:28:32,291 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand 4 states. [2020-12-23 09:28:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:32,340 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2020-12-23 09:28:32,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:28:32,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2020-12-23 09:28:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:32,345 INFO L225 Difference]: With dead ends: 811 [2020-12-23 09:28:32,345 INFO L226 Difference]: Without dead ends: 580 [2020-12-23 09:28:32,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:28:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2020-12-23 09:28:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2020-12-23 09:28:32,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-12-23 09:28:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 846 transitions. [2020-12-23 09:28:32,387 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 846 transitions. Word has length 86 [2020-12-23 09:28:32,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:32,388 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 846 transitions. [2020-12-23 09:28:32,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:28:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 846 transitions. [2020-12-23 09:28:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-12-23 09:28:32,391 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:32,391 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:32,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:28:32,392 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:32,394 INFO L82 PathProgramCache]: Analyzing trace with hash -272932917, now seen corresponding path program 1 times [2020-12-23 09:28:32,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:32,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096161112] [2020-12-23 09:28:32,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:32,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096161112] [2020-12-23 09:28:32,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:32,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:28:32,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313593564] [2020-12-23 09:28:32,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:28:32,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:32,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:28:32,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:32,483 INFO L87 Difference]: Start difference. First operand 574 states and 846 transitions. Second operand 5 states. [2020-12-23 09:28:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:32,561 INFO L93 Difference]: Finished difference Result 1097 states and 1620 transitions. [2020-12-23 09:28:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:28:32,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2020-12-23 09:28:32,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:32,565 INFO L225 Difference]: With dead ends: 1097 [2020-12-23 09:28:32,566 INFO L226 Difference]: Without dead ends: 574 [2020-12-23 09:28:32,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:28:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-12-23 09:28:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2020-12-23 09:28:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-12-23 09:28:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 842 transitions. [2020-12-23 09:28:32,606 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 842 transitions. Word has length 87 [2020-12-23 09:28:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:32,606 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 842 transitions. [2020-12-23 09:28:32,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:28:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 842 transitions. [2020-12-23 09:28:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 09:28:32,608 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:32,608 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:32,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:28:32,609 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:32,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:32,609 INFO L82 PathProgramCache]: Analyzing trace with hash 754091632, now seen corresponding path program 1 times [2020-12-23 09:28:32,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:32,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722320051] [2020-12-23 09:28:32,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:32,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722320051] [2020-12-23 09:28:32,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:32,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:32,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335414924] [2020-12-23 09:28:32,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:32,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:32,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:32,652 INFO L87 Difference]: Start difference. First operand 574 states and 842 transitions. Second operand 3 states. [2020-12-23 09:28:32,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:32,749 INFO L93 Difference]: Finished difference Result 1592 states and 2334 transitions. [2020-12-23 09:28:32,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:32,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2020-12-23 09:28:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:32,755 INFO L225 Difference]: With dead ends: 1592 [2020-12-23 09:28:32,756 INFO L226 Difference]: Without dead ends: 1069 [2020-12-23 09:28:32,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2020-12-23 09:28:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 586. [2020-12-23 09:28:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2020-12-23 09:28:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 854 transitions. [2020-12-23 09:28:32,803 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 854 transitions. Word has length 88 [2020-12-23 09:28:32,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:32,804 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 854 transitions. [2020-12-23 09:28:32,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 854 transitions. [2020-12-23 09:28:32,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-23 09:28:32,806 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:32,806 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:32,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:28:32,806 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:32,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:32,807 INFO L82 PathProgramCache]: Analyzing trace with hash -715020230, now seen corresponding path program 1 times [2020-12-23 09:28:32,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:32,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237671757] [2020-12-23 09:28:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:32,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237671757] [2020-12-23 09:28:32,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:32,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:28:32,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729492448] [2020-12-23 09:28:32,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:28:32,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:28:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:32,870 INFO L87 Difference]: Start difference. First operand 586 states and 854 transitions. Second operand 5 states. [2020-12-23 09:28:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:32,958 INFO L93 Difference]: Finished difference Result 1105 states and 1604 transitions. [2020-12-23 09:28:32,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:28:32,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2020-12-23 09:28:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:32,962 INFO L225 Difference]: With dead ends: 1105 [2020-12-23 09:28:32,962 INFO L226 Difference]: Without dead ends: 570 [2020-12-23 09:28:32,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:28:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2020-12-23 09:28:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2020-12-23 09:28:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2020-12-23 09:28:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 818 transitions. [2020-12-23 09:28:33,013 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 818 transitions. Word has length 89 [2020-12-23 09:28:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:33,013 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 818 transitions. [2020-12-23 09:28:33,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:28:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 818 transitions. [2020-12-23 09:28:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 09:28:33,015 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:33,015 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:33,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:28:33,015 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:33,016 INFO L82 PathProgramCache]: Analyzing trace with hash -995630559, now seen corresponding path program 1 times [2020-12-23 09:28:33,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:33,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848185817] [2020-12-23 09:28:33,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:33,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848185817] [2020-12-23 09:28:33,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:33,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:33,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105332877] [2020-12-23 09:28:33,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:33,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:33,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:33,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:33,061 INFO L87 Difference]: Start difference. First operand 570 states and 818 transitions. Second operand 3 states. [2020-12-23 09:28:33,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:33,168 INFO L93 Difference]: Finished difference Result 1592 states and 2288 transitions. [2020-12-23 09:28:33,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:33,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-12-23 09:28:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:33,174 INFO L225 Difference]: With dead ends: 1592 [2020-12-23 09:28:33,175 INFO L226 Difference]: Without dead ends: 1073 [2020-12-23 09:28:33,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2020-12-23 09:28:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 578. [2020-12-23 09:28:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2020-12-23 09:28:33,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 826 transitions. [2020-12-23 09:28:33,271 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 826 transitions. Word has length 90 [2020-12-23 09:28:33,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:33,271 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 826 transitions. [2020-12-23 09:28:33,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 826 transitions. [2020-12-23 09:28:33,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-12-23 09:28:33,273 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:33,273 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:33,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:28:33,273 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:33,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:33,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1893023837, now seen corresponding path program 1 times [2020-12-23 09:28:33,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:33,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088204623] [2020-12-23 09:28:33,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:33,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088204623] [2020-12-23 09:28:33,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:33,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:33,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812659837] [2020-12-23 09:28:33,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:33,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:33,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:33,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:33,329 INFO L87 Difference]: Start difference. First operand 578 states and 826 transitions. Second operand 3 states. [2020-12-23 09:28:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:33,399 INFO L93 Difference]: Finished difference Result 1311 states and 1876 transitions. [2020-12-23 09:28:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:33,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2020-12-23 09:28:33,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:33,404 INFO L225 Difference]: With dead ends: 1311 [2020-12-23 09:28:33,404 INFO L226 Difference]: Without dead ends: 784 [2020-12-23 09:28:33,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2020-12-23 09:28:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 706. [2020-12-23 09:28:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-12-23 09:28:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1022 transitions. [2020-12-23 09:28:33,468 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1022 transitions. Word has length 90 [2020-12-23 09:28:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:33,468 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 1022 transitions. [2020-12-23 09:28:33,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1022 transitions. [2020-12-23 09:28:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-12-23 09:28:33,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:33,470 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:33,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:28:33,471 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:33,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:33,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1064241767, now seen corresponding path program 1 times [2020-12-23 09:28:33,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:33,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124760788] [2020-12-23 09:28:33,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:33,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124760788] [2020-12-23 09:28:33,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057980512] [2020-12-23 09:28:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:33,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:28:33,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:28:33,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:28:33,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 09:28:33,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865990329] [2020-12-23 09:28:33,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:33,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:33,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:33,792 INFO L87 Difference]: Start difference. First operand 706 states and 1022 transitions. Second operand 3 states. [2020-12-23 09:28:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:33,923 INFO L93 Difference]: Finished difference Result 1341 states and 1945 transitions. [2020-12-23 09:28:33,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:33,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2020-12-23 09:28:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:33,928 INFO L225 Difference]: With dead ends: 1341 [2020-12-23 09:28:33,928 INFO L226 Difference]: Without dead ends: 686 [2020-12-23 09:28:33,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2020-12-23 09:28:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2020-12-23 09:28:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2020-12-23 09:28:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 979 transitions. [2020-12-23 09:28:34,003 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 979 transitions. Word has length 92 [2020-12-23 09:28:34,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:34,003 INFO L481 AbstractCegarLoop]: Abstraction has 686 states and 979 transitions. [2020-12-23 09:28:34,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 979 transitions. [2020-12-23 09:28:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-23 09:28:34,005 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:34,006 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:34,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 09:28:34,224 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:34,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:34,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1841919225, now seen corresponding path program 1 times [2020-12-23 09:28:34,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:34,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972767993] [2020-12-23 09:28:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:34,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972767993] [2020-12-23 09:28:34,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488344881] [2020-12-23 09:28:34,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:34,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:28:34,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:28:34,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:28:34,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 09:28:34,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786066197] [2020-12-23 09:28:34,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:34,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:34,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:34,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:34,531 INFO L87 Difference]: Start difference. First operand 686 states and 979 transitions. Second operand 3 states. [2020-12-23 09:28:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:34,665 INFO L93 Difference]: Finished difference Result 2025 states and 2894 transitions. [2020-12-23 09:28:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:34,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-12-23 09:28:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:34,673 INFO L225 Difference]: With dead ends: 2025 [2020-12-23 09:28:34,673 INFO L226 Difference]: Without dead ends: 1364 [2020-12-23 09:28:34,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-12-23 09:28:34,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1361. [2020-12-23 09:28:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2020-12-23 09:28:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1921 transitions. [2020-12-23 09:28:34,817 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1921 transitions. Word has length 93 [2020-12-23 09:28:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:34,817 INFO L481 AbstractCegarLoop]: Abstraction has 1361 states and 1921 transitions. [2020-12-23 09:28:34,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1921 transitions. [2020-12-23 09:28:34,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-23 09:28:34,820 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:34,820 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:35,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 09:28:35,034 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash 155739387, now seen corresponding path program 1 times [2020-12-23 09:28:35,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:35,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454723874] [2020-12-23 09:28:35,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:35,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:28:35,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454723874] [2020-12-23 09:28:35,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:35,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:35,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66484413] [2020-12-23 09:28:35,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:35,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:35,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:35,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:35,073 INFO L87 Difference]: Start difference. First operand 1361 states and 1921 transitions. Second operand 3 states. [2020-12-23 09:28:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:35,198 INFO L93 Difference]: Finished difference Result 2736 states and 3861 transitions. [2020-12-23 09:28:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:35,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-12-23 09:28:35,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:35,206 INFO L225 Difference]: With dead ends: 2736 [2020-12-23 09:28:35,206 INFO L226 Difference]: Without dead ends: 1463 [2020-12-23 09:28:35,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-12-23 09:28:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2020-12-23 09:28:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2020-12-23 09:28:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2048 transitions. [2020-12-23 09:28:35,318 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2048 transitions. Word has length 93 [2020-12-23 09:28:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:35,318 INFO L481 AbstractCegarLoop]: Abstraction has 1463 states and 2048 transitions. [2020-12-23 09:28:35,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2048 transitions. [2020-12-23 09:28:35,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-12-23 09:28:35,321 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:35,321 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:35,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:28:35,322 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:35,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:35,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1889843837, now seen corresponding path program 1 times [2020-12-23 09:28:35,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:35,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368057717] [2020-12-23 09:28:35,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:28:35,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368057717] [2020-12-23 09:28:35,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:35,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:35,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170927646] [2020-12-23 09:28:35,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:35,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:35,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:35,357 INFO L87 Difference]: Start difference. First operand 1463 states and 2048 transitions. Second operand 3 states. [2020-12-23 09:28:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:35,476 INFO L93 Difference]: Finished difference Result 2354 states and 3302 transitions. [2020-12-23 09:28:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:35,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2020-12-23 09:28:35,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:35,481 INFO L225 Difference]: With dead ends: 2354 [2020-12-23 09:28:35,481 INFO L226 Difference]: Without dead ends: 973 [2020-12-23 09:28:35,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:35,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2020-12-23 09:28:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2020-12-23 09:28:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2020-12-23 09:28:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1351 transitions. [2020-12-23 09:28:35,583 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1351 transitions. Word has length 93 [2020-12-23 09:28:35,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:35,584 INFO L481 AbstractCegarLoop]: Abstraction has 973 states and 1351 transitions. [2020-12-23 09:28:35,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1351 transitions. [2020-12-23 09:28:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 09:28:35,587 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:35,588 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:35,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:28:35,588 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash 852035983, now seen corresponding path program 1 times [2020-12-23 09:28:35,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:35,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339205205] [2020-12-23 09:28:35,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:28:35,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339205205] [2020-12-23 09:28:35,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:35,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:28:35,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949937070] [2020-12-23 09:28:35,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:28:35,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:35,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:28:35,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:28:35,665 INFO L87 Difference]: Start difference. First operand 973 states and 1351 transitions. Second operand 4 states. [2020-12-23 09:28:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:35,730 INFO L93 Difference]: Finished difference Result 1258 states and 1743 transitions. [2020-12-23 09:28:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:28:35,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-12-23 09:28:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:35,733 INFO L225 Difference]: With dead ends: 1258 [2020-12-23 09:28:35,733 INFO L226 Difference]: Without dead ends: 373 [2020-12-23 09:28:35,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:28:35,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2020-12-23 09:28:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2020-12-23 09:28:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-12-23 09:28:35,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 504 transitions. [2020-12-23 09:28:35,776 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 504 transitions. Word has length 94 [2020-12-23 09:28:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:35,776 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 504 transitions. [2020-12-23 09:28:35,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:28:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 504 transitions. [2020-12-23 09:28:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 09:28:35,779 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:35,780 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:35,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:28:35,780 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:35,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1821155806, now seen corresponding path program 1 times [2020-12-23 09:28:35,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:35,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554689540] [2020-12-23 09:28:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:35,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554689540] [2020-12-23 09:28:35,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785736935] [2020-12-23 09:28:35,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:35,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:28:35,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:28:36,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:28:36,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 09:28:36,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103690889] [2020-12-23 09:28:36,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:36,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:36,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:36,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:36,071 INFO L87 Difference]: Start difference. First operand 373 states and 504 transitions. Second operand 3 states. [2020-12-23 09:28:36,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:36,216 INFO L93 Difference]: Finished difference Result 1059 states and 1432 transitions. [2020-12-23 09:28:36,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:36,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-23 09:28:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:36,221 INFO L225 Difference]: With dead ends: 1059 [2020-12-23 09:28:36,222 INFO L226 Difference]: Without dead ends: 732 [2020-12-23 09:28:36,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:36,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-12-23 09:28:36,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 729. [2020-12-23 09:28:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2020-12-23 09:28:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 973 transitions. [2020-12-23 09:28:36,293 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 973 transitions. Word has length 94 [2020-12-23 09:28:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:36,294 INFO L481 AbstractCegarLoop]: Abstraction has 729 states and 973 transitions. [2020-12-23 09:28:36,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 973 transitions. [2020-12-23 09:28:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 09:28:36,296 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:36,296 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:36,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-12-23 09:28:36,511 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:36,514 INFO L82 PathProgramCache]: Analyzing trace with hash 134975968, now seen corresponding path program 1 times [2020-12-23 09:28:36,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:36,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012562029] [2020-12-23 09:28:36,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:28:36,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012562029] [2020-12-23 09:28:36,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:36,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:36,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780799453] [2020-12-23 09:28:36,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:36,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:36,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:36,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:36,559 INFO L87 Difference]: Start difference. First operand 729 states and 973 transitions. Second operand 3 states. [2020-12-23 09:28:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:36,639 INFO L93 Difference]: Finished difference Result 1382 states and 1844 transitions. [2020-12-23 09:28:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:36,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-23 09:28:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:36,644 INFO L225 Difference]: With dead ends: 1382 [2020-12-23 09:28:36,644 INFO L226 Difference]: Without dead ends: 811 [2020-12-23 09:28:36,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2020-12-23 09:28:36,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2020-12-23 09:28:36,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2020-12-23 09:28:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1067 transitions. [2020-12-23 09:28:36,710 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1067 transitions. Word has length 94 [2020-12-23 09:28:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:36,710 INFO L481 AbstractCegarLoop]: Abstraction has 811 states and 1067 transitions. [2020-12-23 09:28:36,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1067 transitions. [2020-12-23 09:28:36,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-12-23 09:28:36,713 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:36,713 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:36,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:28:36,714 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:36,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:36,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1869080418, now seen corresponding path program 1 times [2020-12-23 09:28:36,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:36,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227566427] [2020-12-23 09:28:36,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:28:36,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227566427] [2020-12-23 09:28:36,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:36,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:28:36,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873307082] [2020-12-23 09:28:36,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:36,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:36,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:36,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:36,752 INFO L87 Difference]: Start difference. First operand 811 states and 1067 transitions. Second operand 3 states. [2020-12-23 09:28:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:36,813 INFO L93 Difference]: Finished difference Result 1208 states and 1594 transitions. [2020-12-23 09:28:36,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:36,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-12-23 09:28:36,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:36,817 INFO L225 Difference]: With dead ends: 1208 [2020-12-23 09:28:36,817 INFO L226 Difference]: Without dead ends: 551 [2020-12-23 09:28:36,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:28:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2020-12-23 09:28:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2020-12-23 09:28:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-12-23 09:28:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 712 transitions. [2020-12-23 09:28:36,862 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 712 transitions. Word has length 94 [2020-12-23 09:28:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:36,863 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 712 transitions. [2020-12-23 09:28:36,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 712 transitions. [2020-12-23 09:28:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 09:28:36,865 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:36,865 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:36,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:28:36,865 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:36,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash 990151219, now seen corresponding path program 1 times [2020-12-23 09:28:36,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:36,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519314162] [2020-12-23 09:28:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:28:36,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519314162] [2020-12-23 09:28:36,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:36,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:28:36,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190343541] [2020-12-23 09:28:36,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:28:36,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:36,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:28:36,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:28:36,962 INFO L87 Difference]: Start difference. First operand 551 states and 712 transitions. Second operand 4 states. [2020-12-23 09:28:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:37,018 INFO L93 Difference]: Finished difference Result 820 states and 1062 transitions. [2020-12-23 09:28:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:28:37,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-12-23 09:28:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:37,021 INFO L225 Difference]: With dead ends: 820 [2020-12-23 09:28:37,022 INFO L226 Difference]: Without dead ends: 427 [2020-12-23 09:28:37,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:28:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-12-23 09:28:37,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-12-23 09:28:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-12-23 09:28:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 542 transitions. [2020-12-23 09:28:37,066 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 542 transitions. Word has length 95 [2020-12-23 09:28:37,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:37,067 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 542 transitions. [2020-12-23 09:28:37,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:28:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 542 transitions. [2020-12-23 09:28:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 09:28:37,069 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:37,069 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:37,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:28:37,069 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:37,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:37,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1943155422, now seen corresponding path program 1 times [2020-12-23 09:28:37,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:37,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703123083] [2020-12-23 09:28:37,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:37,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703123083] [2020-12-23 09:28:37,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593047482] [2020-12-23 09:28:37,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:37,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:28:37,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-23 09:28:37,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:28:37,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-12-23 09:28:37,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137137038] [2020-12-23 09:28:37,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:28:37,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:37,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:28:37,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:37,314 INFO L87 Difference]: Start difference. First operand 427 states and 542 transitions. Second operand 3 states. [2020-12-23 09:28:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:37,407 INFO L93 Difference]: Finished difference Result 1163 states and 1470 transitions. [2020-12-23 09:28:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:28:37,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-12-23 09:28:37,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:37,411 INFO L225 Difference]: With dead ends: 1163 [2020-12-23 09:28:37,411 INFO L226 Difference]: Without dead ends: 822 [2020-12-23 09:28:37,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2020-12-23 09:28:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2020-12-23 09:28:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2020-12-23 09:28:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1023 transitions. [2020-12-23 09:28:37,483 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1023 transitions. Word has length 95 [2020-12-23 09:28:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:37,483 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 1023 transitions. [2020-12-23 09:28:37,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:28:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1023 transitions. [2020-12-23 09:28:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 09:28:37,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:37,486 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:37,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:37,700 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:37,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2020-12-23 09:28:37,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:37,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947000195] [2020-12-23 09:28:37,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:37,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947000195] [2020-12-23 09:28:37,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113411091] [2020-12-23 09:28:37,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:28:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:37,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 09:28:37,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:28:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:37,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:28:37,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2020-12-23 09:28:37,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911427828] [2020-12-23 09:28:37,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:28:37,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:37,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:28:37,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:37,988 INFO L87 Difference]: Start difference. First operand 819 states and 1023 transitions. Second operand 4 states. [2020-12-23 09:28:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:38,104 INFO L93 Difference]: Finished difference Result 1704 states and 2152 transitions. [2020-12-23 09:28:38,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:28:38,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-12-23 09:28:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:38,111 INFO L225 Difference]: With dead ends: 1704 [2020-12-23 09:28:38,111 INFO L226 Difference]: Without dead ends: 1054 [2020-12-23 09:28:38,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2020-12-23 09:28:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1012. [2020-12-23 09:28:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2020-12-23 09:28:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1268 transitions. [2020-12-23 09:28:38,217 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1268 transitions. Word has length 95 [2020-12-23 09:28:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:38,217 INFO L481 AbstractCegarLoop]: Abstraction has 1012 states and 1268 transitions. [2020-12-23 09:28:38,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:28:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1268 transitions. [2020-12-23 09:28:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 09:28:38,219 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:38,219 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:38,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-23 09:28:38,435 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:38,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:38,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2020-12-23 09:28:38,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:38,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390871063] [2020-12-23 09:28:38,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:38,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390871063] [2020-12-23 09:28:38,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:38,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:28:38,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063066402] [2020-12-23 09:28:38,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:28:38,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:28:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:28:38,481 INFO L87 Difference]: Start difference. First operand 1012 states and 1268 transitions. Second operand 4 states. [2020-12-23 09:28:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:38,636 INFO L93 Difference]: Finished difference Result 2540 states and 3200 transitions. [2020-12-23 09:28:38,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:28:38,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-12-23 09:28:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:38,645 INFO L225 Difference]: With dead ends: 2540 [2020-12-23 09:28:38,645 INFO L226 Difference]: Without dead ends: 1698 [2020-12-23 09:28:38,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:28:38,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2020-12-23 09:28:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1030. [2020-12-23 09:28:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2020-12-23 09:28:38,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1286 transitions. [2020-12-23 09:28:38,748 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1286 transitions. Word has length 95 [2020-12-23 09:28:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:38,748 INFO L481 AbstractCegarLoop]: Abstraction has 1030 states and 1286 transitions. [2020-12-23 09:28:38,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:28:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1286 transitions. [2020-12-23 09:28:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 09:28:38,751 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:28:38,751 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:28:38,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:28:38,752 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:28:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:28:38,752 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2020-12-23 09:28:38,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:28:38,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249911778] [2020-12-23 09:28:38,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:28:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:28:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:28:38,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249911778] [2020-12-23 09:28:38,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:28:38,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:28:38,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5021985] [2020-12-23 09:28:38,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:28:38,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:28:38,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:28:38,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:28:38,836 INFO L87 Difference]: Start difference. First operand 1030 states and 1286 transitions. Second operand 5 states. [2020-12-23 09:28:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:28:38,918 INFO L93 Difference]: Finished difference Result 1285 states and 1598 transitions. [2020-12-23 09:28:38,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:28:38,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-12-23 09:28:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:28:38,919 INFO L225 Difference]: With dead ends: 1285 [2020-12-23 09:28:38,919 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 09:28:38,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:28:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 09:28:38,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 09:28:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 09:28:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 09:28:38,922 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2020-12-23 09:28:38,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:28:38,922 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 09:28:38,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:28:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 09:28:38,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 09:28:38,922 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:28:38,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 09:28:40,173 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-12-23 09:28:40,380 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 51 [2020-12-23 09:28:40,614 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-12-23 09:28:40,817 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-12-23 09:28:40,982 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-23 09:28:41,195 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-12-23 09:28:41,337 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-12-23 09:28:41,689 WARN L197 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 58 [2020-12-23 09:28:41,887 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-23 09:28:42,015 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-12-23 09:28:42,238 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-12-23 09:28:42,395 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-12-23 09:28:42,502 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-12-23 09:28:42,632 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-12-23 09:28:42,769 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2020-12-23 09:28:42,905 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-23 09:28:43,012 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-12-23 09:28:43,252 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-12-23 09:28:43,510 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 50 [2020-12-23 09:28:43,630 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2020-12-23 09:28:43,855 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-12-23 09:28:44,152 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 55 [2020-12-23 09:28:44,313 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2020-12-23 09:28:44,516 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-23 09:28:44,734 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2020-12-23 09:28:44,934 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-12-23 09:28:45,178 WARN L197 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2020-12-23 09:28:45,183 INFO L189 CegarLoopUtils]: For program point L399(lines 399 404) no Hoare annotation was computed. [2020-12-23 09:28:45,184 INFO L185 CegarLoopUtils]: At program point L333-1(lines 309 341) the Hoare annotation is: (let ((.cse6 (<= 2 ~b1_ev~0)) (.cse0 (= ~d0_ev~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse16 (= ~b1_ev~0 1)) (.cse5 (not (= ~b1_val~0 0))) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse15 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13 .cse14))) [2020-12-23 09:28:45,184 INFO L185 CegarLoopUtils]: At program point L267(lines 259 269) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) .cse13))) [2020-12-23 09:28:45,184 INFO L185 CegarLoopUtils]: At program point L366-3(lines 342 374) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-23 09:28:45,184 INFO L185 CegarLoopUtils]: At program point L333-3(lines 309 341) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 (= ~d0_ev~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-23 09:28:45,185 INFO L185 CegarLoopUtils]: At program point L267-1(lines 259 269) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (not (= ~b0_val~0 0)) (<= 2 ~d0_ev~0) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-23 09:28:45,185 INFO L185 CegarLoopUtils]: At program point L268(lines 256 270) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~1 0)) .cse13))) [2020-12-23 09:28:45,185 INFO L185 CegarLoopUtils]: At program point L268-1(lines 256 270) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-23 09:28:45,186 INFO L189 CegarLoopUtils]: For program point L103(lines 103 118) no Hoare annotation was computed. [2020-12-23 09:28:45,186 INFO L189 CegarLoopUtils]: For program point L103-1(lines 103 118) no Hoare annotation was computed. [2020-12-23 09:28:45,186 INFO L189 CegarLoopUtils]: For program point L71(lines 43 93) no Hoare annotation was computed. [2020-12-23 09:28:45,186 INFO L192 CegarLoopUtils]: At program point L501(lines 485 503) the Hoare annotation is: true [2020-12-23 09:28:45,186 INFO L185 CegarLoopUtils]: At program point L303(lines 271 308) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-23 09:28:45,186 INFO L189 CegarLoopUtils]: For program point L204(lines 204 210) no Hoare annotation was computed. [2020-12-23 09:28:45,187 INFO L185 CegarLoopUtils]: At program point L204-1(lines 203 241) the Hoare annotation is: (and (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (= ~comp_m1_st~0 0) (= ~d1_req_up~0 1) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (not (= ~b0_val~0 0)) (<= 2 ~d0_ev~0) (= ~b0_ev~0 0) (= 1 ~b1_req_up~0) (not (= ~d1_val_t~0 0)) (= ~d0_req_up~0 1) (= 0 ~z_val_t~0) (<= 2 ~d1_ev~0)) [2020-12-23 09:28:45,187 INFO L189 CegarLoopUtils]: For program point L204-2(lines 204 210) no Hoare annotation was computed. [2020-12-23 09:28:45,187 INFO L185 CegarLoopUtils]: At program point L204-3(lines 203 241) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-23 09:28:45,188 INFO L189 CegarLoopUtils]: For program point L72(lines 72 76) no Hoare annotation was computed. [2020-12-23 09:28:45,188 INFO L189 CegarLoopUtils]: For program point L107(lines 107 117) no Hoare annotation was computed. [2020-12-23 09:28:45,188 INFO L189 CegarLoopUtils]: For program point L107-1(lines 107 117) no Hoare annotation was computed. [2020-12-23 09:28:45,188 INFO L189 CegarLoopUtils]: For program point L174(lines 174 179) no Hoare annotation was computed. [2020-12-23 09:28:45,188 INFO L189 CegarLoopUtils]: For program point L174-2(lines 174 179) no Hoare annotation was computed. [2020-12-23 09:28:45,188 INFO L189 CegarLoopUtils]: For program point L174-3(lines 174 179) no Hoare annotation was computed. [2020-12-23 09:28:45,189 INFO L189 CegarLoopUtils]: For program point L174-5(lines 174 179) no Hoare annotation was computed. [2020-12-23 09:28:45,189 INFO L185 CegarLoopUtils]: At program point L406(lines 395 408) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-23 09:28:45,191 INFO L185 CegarLoopUtils]: At program point L407(lines 391 409) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-23 09:28:45,191 INFO L189 CegarLoopUtils]: For program point L44(lines 44 52) no Hoare annotation was computed. [2020-12-23 09:28:45,191 INFO L189 CegarLoopUtils]: For program point L44-1(lines 43 93) no Hoare annotation was computed. [2020-12-23 09:28:45,191 INFO L189 CegarLoopUtils]: For program point L11(line 11) no Hoare annotation was computed. [2020-12-23 09:28:45,192 INFO L189 CegarLoopUtils]: For program point L441(lines 441 445) no Hoare annotation was computed. [2020-12-23 09:28:45,192 INFO L189 CegarLoopUtils]: For program point L144(lines 144 149) no Hoare annotation was computed. [2020-12-23 09:28:45,192 INFO L189 CegarLoopUtils]: For program point L111(lines 111 116) no Hoare annotation was computed. [2020-12-23 09:28:45,192 INFO L189 CegarLoopUtils]: For program point L144-2(lines 144 149) no Hoare annotation was computed. [2020-12-23 09:28:45,192 INFO L189 CegarLoopUtils]: For program point L111-1(lines 111 116) no Hoare annotation was computed. [2020-12-23 09:28:45,192 INFO L189 CegarLoopUtils]: For program point L45(lines 45 49) no Hoare annotation was computed. [2020-12-23 09:28:45,192 INFO L189 CegarLoopUtils]: For program point L144-3(lines 144 149) no Hoare annotation was computed. [2020-12-23 09:28:45,192 INFO L189 CegarLoopUtils]: For program point L144-5(lines 144 149) no Hoare annotation was computed. [2020-12-23 09:28:45,192 INFO L185 CegarLoopUtils]: At program point L211(lines 203 241) the Hoare annotation is: (let ((.cse0 (not (= ~d0_val_t~0 0))) (.cse1 (= ~z_ev~0 2)) (.cse2 (= ~z_val~0 0)) (.cse3 (= ~comp_m1_st~0 0)) (.cse4 (= ~d1_req_up~0 1)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~b0_val~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (= ~b0_ev~0 0)) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= ~d0_req_up~0 1)) (.cse14 (= 0 ~z_val_t~0)) (.cse15 (<= 2 ~d1_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~b1_ev~0 0) .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 ~b1_ev~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-12-23 09:28:45,193 INFO L185 CegarLoopUtils]: At program point L211-1(lines 203 241) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-23 09:28:45,194 INFO L189 CegarLoopUtils]: For program point L278(line 278) no Hoare annotation was computed. [2020-12-23 09:28:45,194 INFO L189 CegarLoopUtils]: For program point L346-1(lines 345 373) no Hoare annotation was computed. [2020-12-23 09:28:45,195 INFO L189 CegarLoopUtils]: For program point L313-1(lines 312 340) no Hoare annotation was computed. [2020-12-23 09:28:45,195 INFO L189 CegarLoopUtils]: For program point L313-2(lines 313 317) no Hoare annotation was computed. [2020-12-23 09:28:45,195 INFO L189 CegarLoopUtils]: For program point L346-3(lines 345 373) no Hoare annotation was computed. [2020-12-23 09:28:45,195 INFO L185 CegarLoopUtils]: At program point L247-1(lines 313 317) the Hoare annotation is: (let ((.cse7 (= ~d0_ev~0 0)) (.cse13 (= ~b1_ev~0 0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (not (= ~b1_val~0 0))) (.cse15 (<= 2 ~b1_ev~0)) (.cse5 (not (= ~b0_req_up~0 1))) (.cse6 (not (= ~b1_val_t~0 0))) (.cse8 (not (= ~b0_val~0 0))) (.cse16 (<= 2 ~d0_ev~0)) (.cse9 (not (= 1 ~b1_req_up~0))) (.cse10 (not (= ~d1_val~0 0))) (.cse11 (= ~b0_ev~0 0)) (.cse12 (not (= ~d1_val_t~0 0))) (.cse14 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse8 .cse16 .cse9 .cse10 .cse11 .cse12 .cse14))) [2020-12-23 09:28:45,195 INFO L189 CegarLoopUtils]: For program point L313-4(lines 312 340) no Hoare annotation was computed. [2020-12-23 09:28:45,195 INFO L189 CegarLoopUtils]: For program point L83(lines 83 87) no Hoare annotation was computed. [2020-12-23 09:28:45,195 INFO L189 CegarLoopUtils]: For program point L83-2(lines 80 88) no Hoare annotation was computed. [2020-12-23 09:28:45,195 INFO L185 CegarLoopUtils]: At program point L447(lines 493 499) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~b1_val_t~0 0)) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (not (= 1 ~b1_req_up~0)) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (= 0 ~z_val_t~0) (not (= ~b0_req_up~0 1))) [2020-12-23 09:28:45,195 INFO L189 CegarLoopUtils]: For program point L282(lines 282 286) no Hoare annotation was computed. [2020-12-23 09:28:45,196 INFO L189 CegarLoopUtils]: For program point L282-1(lines 277 302) no Hoare annotation was computed. [2020-12-23 09:28:45,196 INFO L189 CegarLoopUtils]: For program point L382(lines 382 386) no Hoare annotation was computed. [2020-12-23 09:28:45,196 INFO L185 CegarLoopUtils]: At program point L382-2(lines 346 350) the Hoare annotation is: (let ((.cse11 (<= 2 ~d0_ev~0)) (.cse5 (= ~b1_ev~0 1)) (.cse17 (= ~d0_ev~0 1)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse16 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15))) [2020-12-23 09:28:45,196 INFO L189 CegarLoopUtils]: For program point L382-3(lines 382 386) no Hoare annotation was computed. [2020-12-23 09:28:45,196 INFO L185 CegarLoopUtils]: At program point L382-5(lines 346 350) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 (= ~d0_ev~0 1) .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-23 09:28:45,197 INFO L185 CegarLoopUtils]: At program point L482(lines 453 484) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (= ~z_ev~0 2) (= ~z_val~0 0) (= ~comp_m1_st~0 0) (= ~d1_req_up~0 1) (= ~d1_val_t~0 ~b0_val_t~0) (<= 2 ~b1_ev~0) (= ~b0_val_t~0 1) (<= 2 ~d0_ev~0) (= ~b0_val~0 0) (= 1 ~b1_req_up~0) (= ~b1_val_t~0 ~b0_val_t~0) (= ~d0_req_up~0 1) (= 0 ~z_val_t~0) (= ~d0_val_t~0 ~b0_val_t~0) (= ~b0_req_up~0 1) (<= 2 ~d1_ev~0)) [2020-12-23 09:28:45,197 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-23 09:28:45,197 INFO L185 CegarLoopUtils]: At program point L218(lines 203 241) the Hoare annotation is: (let ((.cse9 (= ~d0_ev~0 0)) (.cse14 (= ~b1_ev~0 0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (= ~d1_req_up~0 1)) (.cse6 (not (= ~b1_val~0 0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~b0_val~0 0))) (.cse18 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0)) (.cse16 (<= 2 ~d1_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse18 .cse11 .cse12 .cse13 .cse15 .cse16))) [2020-12-23 09:28:45,197 INFO L185 CegarLoopUtils]: At program point L218-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-23 09:28:45,197 INFO L189 CegarLoopUtils]: For program point L53(lines 43 93) no Hoare annotation was computed. [2020-12-23 09:28:45,197 INFO L189 CegarLoopUtils]: For program point L351-1(lines 345 373) no Hoare annotation was computed. [2020-12-23 09:28:45,197 INFO L189 CegarLoopUtils]: For program point L318-1(lines 312 340) no Hoare annotation was computed. [2020-12-23 09:28:45,197 INFO L189 CegarLoopUtils]: For program point L351-3(lines 345 373) no Hoare annotation was computed. [2020-12-23 09:28:45,197 INFO L189 CegarLoopUtils]: For program point L318-3(lines 312 340) no Hoare annotation was computed. [2020-12-23 09:28:45,197 INFO L189 CegarLoopUtils]: For program point L54(lines 54 58) no Hoare annotation was computed. [2020-12-23 09:28:45,198 INFO L185 CegarLoopUtils]: At program point L121(lines 98 123) the Hoare annotation is: (let ((.cse5 (= ~b1_ev~0 1)) (.cse11 (<= 2 ~d0_ev~0)) (.cse16 (= ~d0_ev~0 1)) (.cse0 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse17 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (not (= ~d1_val~0 0))) (.cse14 (not (= ~d1_val_t~0 0))) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse17 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15))) [2020-12-23 09:28:45,198 INFO L185 CegarLoopUtils]: At program point L121-1(lines 98 123) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= ~d0_ev~0 1) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-23 09:28:45,198 INFO L185 CegarLoopUtils]: At program point L287(lines 277 302) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse10 (not (= ~b0_val~0 0))) (.cse9 (<= 2 ~d0_ev~0)) (.cse11 (not (= 1 ~b1_req_up~0))) (.cse12 (not (= ~d1_val~0 0))) (.cse13 (not (= ~d1_val_t~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= 0 ~z_val_t~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~comp_m1_st~0 0) .cse5 .cse6 .cse7 .cse8 .cse10 .cse9 .cse11 .cse12 .cse13))) [2020-12-23 09:28:45,198 INFO L185 CegarLoopUtils]: At program point L122(lines 95 124) the Hoare annotation is: (let ((.cse5 (= ~b1_ev~0 1)) (.cse17 (= ~d0_ev~0 1)) (.cse0 (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse6 (not (= ~b1_val~0 0))) (.cse18 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (= ~b0_ev~0 1)) (.cse10 (not (= ~b0_val~0 0))) (.cse11 (<= 2 ~d0_ev~0)) (.cse12 (not (= 1 ~b1_req_up~0))) (.cse13 (= |ULTIMATE.start_is_method1_triggered_#res| 1)) (.cse14 (not (= ~d1_val~0 0))) (.cse15 (not (= ~d1_val_t~0 0))) (.cse16 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse17 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2020-12-23 09:28:45,198 INFO L185 CegarLoopUtils]: At program point L122-1(lines 95 124) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 (= ~d0_ev~0 1) (= ULTIMATE.start_is_method1_triggered_~__retres1~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_is_method1_triggered_#res| 1) .cse11 .cse12 .cse13))) [2020-12-23 09:28:45,198 INFO L189 CegarLoopUtils]: For program point L189(lines 189 194) no Hoare annotation was computed. [2020-12-23 09:28:45,198 INFO L189 CegarLoopUtils]: For program point L189-2(lines 189 194) no Hoare annotation was computed. [2020-12-23 09:28:45,199 INFO L189 CegarLoopUtils]: For program point L189-3(lines 189 194) no Hoare annotation was computed. [2020-12-23 09:28:45,199 INFO L189 CegarLoopUtils]: For program point L189-5(lines 189 194) no Hoare annotation was computed. [2020-12-23 09:28:45,199 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-23 09:28:45,199 INFO L189 CegarLoopUtils]: For program point L356-1(lines 345 373) no Hoare annotation was computed. [2020-12-23 09:28:45,199 INFO L189 CegarLoopUtils]: For program point L323-1(lines 312 340) no Hoare annotation was computed. [2020-12-23 09:28:45,199 INFO L189 CegarLoopUtils]: For program point L356-3(lines 345 373) no Hoare annotation was computed. [2020-12-23 09:28:45,199 INFO L189 CegarLoopUtils]: For program point L323-3(lines 312 340) no Hoare annotation was computed. [2020-12-23 09:28:45,199 INFO L189 CegarLoopUtils]: For program point L291(lines 291 298) no Hoare annotation was computed. [2020-12-23 09:28:45,200 INFO L185 CegarLoopUtils]: At program point L225(lines 203 241) the Hoare annotation is: (let ((.cse16 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse17 (= ~d0_ev~0 0)) (.cse8 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= ~b1_ev~0 0)) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-12-23 09:28:45,200 INFO L185 CegarLoopUtils]: At program point L225-1(lines 203 241) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-23 09:28:45,200 INFO L189 CegarLoopUtils]: For program point L159(lines 159 164) no Hoare annotation was computed. [2020-12-23 09:28:45,200 INFO L189 CegarLoopUtils]: For program point L159-2(lines 159 164) no Hoare annotation was computed. [2020-12-23 09:28:45,200 INFO L189 CegarLoopUtils]: For program point L159-3(lines 159 164) no Hoare annotation was computed. [2020-12-23 09:28:45,200 INFO L189 CegarLoopUtils]: For program point L159-5(lines 159 164) no Hoare annotation was computed. [2020-12-23 09:28:45,200 INFO L185 CegarLoopUtils]: At program point L424-1(lines 342 446) the Hoare annotation is: (and (<= 2 ~b0_ev~0) (not (= ~d0_val~0 0)) (not (= ~d0_val_t~0 0)) (= ~z_ev~0 2) (= ~z_val~0 0) (not (= ~b1_val~0 0)) (<= 2 ~b1_ev~0) (not (= ~b0_req_up~0 1)) (not (= ~b1_val_t~0 0)) (<= 2 ~d0_ev~0) (not (= ~b0_val~0 0)) (not (= 1 ~b1_req_up~0)) (not (= ~d1_val~0 0)) (not (= ~d1_val_t~0 0)) (= 0 ~z_val_t~0)) [2020-12-23 09:28:45,201 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-23 09:28:45,201 INFO L189 CegarLoopUtils]: For program point L425(line 425) no Hoare annotation was computed. [2020-12-23 09:28:45,201 INFO L189 CegarLoopUtils]: For program point L260(lines 260 265) no Hoare annotation was computed. [2020-12-23 09:28:45,201 INFO L189 CegarLoopUtils]: For program point L260-1(lines 260 265) no Hoare annotation was computed. [2020-12-23 09:28:45,201 INFO L189 CegarLoopUtils]: For program point L129(lines 129 134) no Hoare annotation was computed. [2020-12-23 09:28:45,201 INFO L189 CegarLoopUtils]: For program point L129-2(lines 129 134) no Hoare annotation was computed. [2020-12-23 09:28:45,201 INFO L189 CegarLoopUtils]: For program point L129-3(lines 129 134) no Hoare annotation was computed. [2020-12-23 09:28:45,201 INFO L189 CegarLoopUtils]: For program point L129-5(lines 129 134) no Hoare annotation was computed. [2020-12-23 09:28:45,201 INFO L192 CegarLoopUtils]: At program point L493(lines 493 499) the Hoare annotation is: true [2020-12-23 09:28:45,201 INFO L189 CegarLoopUtils]: For program point L361-1(lines 345 373) no Hoare annotation was computed. [2020-12-23 09:28:45,202 INFO L189 CegarLoopUtils]: For program point L328-1(lines 312 340) no Hoare annotation was computed. [2020-12-23 09:28:45,202 INFO L189 CegarLoopUtils]: For program point L361-3(lines 345 373) no Hoare annotation was computed. [2020-12-23 09:28:45,202 INFO L189 CegarLoopUtils]: For program point L328-3(lines 312 340) no Hoare annotation was computed. [2020-12-23 09:28:45,202 INFO L189 CegarLoopUtils]: For program point L65(lines 65 69) no Hoare annotation was computed. [2020-12-23 09:28:45,202 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-23 09:28:45,202 INFO L189 CegarLoopUtils]: For program point L65-2(lines 43 93) no Hoare annotation was computed. [2020-12-23 09:28:45,202 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2020-12-23 09:28:45,202 INFO L189 CegarLoopUtils]: For program point L99(lines 99 119) no Hoare annotation was computed. [2020-12-23 09:28:45,202 INFO L189 CegarLoopUtils]: For program point L99-1(lines 99 119) no Hoare annotation was computed. [2020-12-23 09:28:45,203 INFO L185 CegarLoopUtils]: At program point L232(lines 247 251) the Hoare annotation is: (let ((.cse16 (<= 2 ~b1_ev~0)) (.cse9 (<= 2 ~d0_ev~0)) (.cse0 (not (= ~d0_val~0 0))) (.cse1 (not (= ~d0_val_t~0 0))) (.cse2 (= ~z_ev~0 2)) (.cse3 (= ~z_val~0 0)) (.cse4 (= ~comp_m1_st~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (not (= ~b1_val_t~0 0))) (.cse17 (= ~d0_ev~0 0)) (.cse8 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (= ~b0_ev~0 0)) (.cse13 (not (= ~d1_val_t~0 0))) (.cse14 (= ~b1_ev~0 0)) (.cse15 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2020-12-23 09:28:45,203 INFO L185 CegarLoopUtils]: At program point L232-1(lines 200 242) the Hoare annotation is: (let ((.cse0 (<= 2 ~b0_ev~0)) (.cse1 (not (= ~d0_val~0 0))) (.cse2 (not (= ~d0_val_t~0 0))) (.cse3 (= ~z_ev~0 2)) (.cse4 (= ~z_val~0 0)) (.cse5 (not (= ~b1_val~0 0))) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (not (= ~b0_req_up~0 1))) (.cse8 (not (= ~b1_val_t~0 0))) (.cse9 (not (= ~b0_val~0 0))) (.cse10 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_val~0 0))) (.cse12 (not (= ~d1_val_t~0 0))) (.cse13 (= 0 ~z_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= 2 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~d0_ev~0 0) .cse9 .cse10 .cse11 .cse12 .cse13))) [2020-12-23 09:28:45,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:28:45 BoogieIcfgContainer [2020-12-23 09:28:45,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:28:45,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:28:45,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:28:45,265 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:28:45,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:28:29" (3/4) ... [2020-12-23 09:28:45,269 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-23 09:28:45,290 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-23 09:28:45,291 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-23 09:28:45,291 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 09:28:45,292 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-23 09:28:45,326 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) [2020-12-23 09:28:45,328 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && !(\result == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) [2020-12-23 09:28:45,329 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) [2020-12-23 09:28:45,423 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/bist_cell.cil.c-witness.graphml [2020-12-23 09:28:45,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:28:45,425 INFO L168 Benchmark]: Toolchain (without parser) took 17140.65 ms. Allocated memory was 176.2 MB in the beginning and 503.3 MB in the end (delta: 327.2 MB). Free memory was 151.0 MB in the beginning and 442.3 MB in the end (delta: -291.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 8.0 GB. [2020-12-23 09:28:45,425 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 176.2 MB. Free memory is still 148.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:28:45,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.57 ms. Allocated memory is still 176.2 MB. Free memory was 150.8 MB in the beginning and 137.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:28:45,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.27 ms. Allocated memory is still 176.2 MB. Free memory was 137.0 MB in the beginning and 134.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:28:45,426 INFO L168 Benchmark]: Boogie Preprocessor took 81.77 ms. Allocated memory is still 176.2 MB. Free memory was 134.7 MB in the beginning and 132.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:28:45,427 INFO L168 Benchmark]: RCFGBuilder took 1022.60 ms. Allocated memory is still 176.2 MB. Free memory was 132.8 MB in the beginning and 132.5 MB in the end (delta: 289.7 kB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:28:45,427 INFO L168 Benchmark]: TraceAbstraction took 15354.21 ms. Allocated memory was 176.2 MB in the beginning and 503.3 MB in the end (delta: 327.2 MB). Free memory was 132.0 MB in the beginning and 452.3 MB in the end (delta: -320.3 MB). Peak memory consumption was 278.4 MB. Max. memory is 8.0 GB. [2020-12-23 09:28:45,428 INFO L168 Benchmark]: Witness Printer took 159.09 ms. Allocated memory is still 503.3 MB. Free memory was 452.3 MB in the beginning and 442.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-12-23 09:28:45,433 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.17 ms. Allocated memory is still 176.2 MB. Free memory is still 148.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 456.57 ms. Allocated memory is still 176.2 MB. Free memory was 150.8 MB in the beginning and 137.2 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 58.27 ms. Allocated memory is still 176.2 MB. Free memory was 137.0 MB in the beginning and 134.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 81.77 ms. Allocated memory is still 176.2 MB. Free memory was 134.7 MB in the beginning and 132.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1022.60 ms. Allocated memory is still 176.2 MB. Free memory was 132.8 MB in the beginning and 132.5 MB in the end (delta: 289.7 kB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15354.21 ms. Allocated memory was 176.2 MB in the beginning and 503.3 MB in the end (delta: 327.2 MB). Free memory was 132.0 MB in the beginning and 452.3 MB in the end (delta: -320.3 MB). Peak memory consumption was 278.4 MB. Max. memory is 8.0 GB. * Witness Printer took 159.09 ms. Allocated memory is still 503.3 MB. Free memory was 452.3 MB in the beginning and 442.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= b0_ev && d0_ev == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= b0_ev && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && d1_val_t == b0_val_t) && 2 <= b1_ev) && b0_val_t == 1) && 2 <= d0_ev) && b0_val == 0) && 1 == b1_req_up) && b1_val_t == b0_val_t) && d0_req_up == 1) && 0 == z_val_t) && d0_val_t == b0_val_t) && b0_req_up == 1) && 2 <= d1_ev - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) - InvariantResult [Line: 493]: Loop Invariant Derived loop invariant: (((((((2 <= b0_ev && !(b1_val_t == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && !(1 == b1_req_up)) && z_val == 0) && !(b1_val == 0)) && 0 == z_val_t) && !(b0_req_up == 1) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && b0_ev == 0) && 1 == b1_req_up) && !(d1_val_t == 0)) && d0_req_up == 1) && 0 == z_val_t) && 2 <= d1_ev - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 256]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && !(\result == 0)) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 346]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && \result == 1) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && 2 <= d1_ev)) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev)) || ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) && 2 <= d1_ev) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((d0_ev == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && d0_req_up == 1) && b1_ev == 0) && 0 == z_val_t) && 2 <= d1_ev) || ((((((((((((((((!(d0_val_t == 0) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && d1_req_up == 1) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && b0_ev == 0) && !(d1_val_t == 0)) && d0_req_up == 1) && 0 == z_val_t) && 2 <= d1_ev) - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && d0_ev == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(__retres1 == 0)) && !(d1_val_t == 0)) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t)) || ((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((!(d0_val == 0) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && comp_m1_st == 0) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && b0_ev == 0) && !(d1_val_t == 0)) && b1_ev == 0) && 0 == z_val_t) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((2 <= b0_ev && d0_ev == 1) && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: (((((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || (((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && b1_ev == 1) && !(b1_val == 0)) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((__retres1 == 1 && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && 2 <= d0_ev) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t)) || (((((((((((((((d0_ev == 1 && __retres1 == 1) && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && b0_ev == 1) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && 2 <= d0_ev) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) || ((((((((((((((2 <= b0_ev && !(d0_val == 0)) && !(d0_val_t == 0)) && z_ev == 2) && z_val == 0) && !(b1_val == 0)) && 2 <= b1_ev) && !(b0_req_up == 1)) && !(b1_val_t == 0)) && d0_ev == 0) && !(b0_val == 0)) && !(1 == b1_req_up)) && !(d1_val == 0)) && !(d1_val_t == 0)) && 0 == z_val_t) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.8s, OverallIterations: 29, TraceHistogramMax: 2, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4787 SDtfs, 2771 SDslu, 4972 SDs, 0 SdLazy, 398 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 588 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1463occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 2015 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 193 NumberOfFragments, 3750 HoareAnnotationTreeSize, 33 FomulaSimplifications, 39368 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 33 FomulaSimplificationsInter, 14097 FormulaSimplificationTreeSizeReductionInter, 5.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2890 NumberOfCodeBlocks, 2890 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2856 ConstructedInterpolants, 0 QuantifiedInterpolants, 458837 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 114/144 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 correct! Received shutdown request...