/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/bitvector/soft_float_1-3a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 11:33:02,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:33:02,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:33:02,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:33:02,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:33:02,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:33:02,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:33:02,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:33:02,528 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:33:02,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:33:02,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:33:02,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:33:02,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:33:02,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:33:02,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:33:02,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:33:02,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:33:02,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:33:02,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:33:02,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:33:02,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:33:02,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:33:02,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:33:02,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:33:02,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:33:02,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:33:02,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:33:02,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:33:02,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:33:02,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:33:02,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:33:02,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:33:02,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:33:02,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:33:02,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:33:02,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:33:02,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:33:02,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:33:02,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:33:02,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:33:02,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:33:02,631 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:33:02,680 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:33:02,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:33:02,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:33:02,683 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:33:02,686 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:33:02,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:33:02,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:33:02,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:33:02,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:33:02,687 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:33:02,687 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:33:02,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:33:02,688 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:33:02,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:33:02,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:33:02,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:33:02,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:33:02,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:33:02,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:33:02,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:33:02,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:33:02,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:33:02,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:33:02,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:33:02,692 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:33:02,692 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 [2021-01-06 11:33:03,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:33:03,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:33:03,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:33:03,096 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:33:03,097 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:33:03,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2021-01-06 11:33:03,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9a3f59f0c/873c1ab54eb64261a01ef3945c125e85/FLAGd0f007234 [2021-01-06 11:33:03,788 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:33:03,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2021-01-06 11:33:03,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9a3f59f0c/873c1ab54eb64261a01ef3945c125e85/FLAGd0f007234 [2021-01-06 11:33:04,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9a3f59f0c/873c1ab54eb64261a01ef3945c125e85 [2021-01-06 11:33:04,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:33:04,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:33:04,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:33:04,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:33:04,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:33:04,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e2ee038 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04, skipping insertion in model container [2021-01-06 11:33:04,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:33:04,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 11:33:04,342 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/bitvector/soft_float_1-3a.c.cil.c[425,438] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~e,] left hand side expression in assignment: lhs: VariableLHS[~m,] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~e,] left hand side expression in assignment: lhs: VariableLHS[~m,] left hand side expression in assignment: lhs: VariableLHS[~m,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~a,] left hand side expression in assignment: lhs: VariableLHS[~b,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~mb~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~eb~0,] left hand side expression in assignment: lhs: VariableLHS[~mb~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~delta~0,] left hand side expression in assignment: lhs: VariableLHS[~mb~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ea~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~a,] left hand side expression in assignment: lhs: VariableLHS[~b,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~mb~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~eb~1,] left hand side expression in assignment: lhs: VariableLHS[~mb~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~2,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~zero~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~sa~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~sa~0,] left hand side expression in assignment: lhs: VariableLHS[~sb~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~sb~0,] left hand side expression in assignment: lhs: VariableLHS[~r_add~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres23~0,] [2021-01-06 11:33:04,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:33:04,444 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 11:33:04,458 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/bitvector/soft_float_1-3a.c.cil.c[425,438] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~e,] left hand side expression in assignment: lhs: VariableLHS[~m,] left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~e,] left hand side expression in assignment: lhs: VariableLHS[~m,] left hand side expression in assignment: lhs: VariableLHS[~m,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~a,] left hand side expression in assignment: lhs: VariableLHS[~b,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~mb~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~eb~0,] left hand side expression in assignment: lhs: VariableLHS[~mb~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~delta~0,] left hand side expression in assignment: lhs: VariableLHS[~mb~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~ea~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] left hand side expression in assignment: lhs: VariableLHS[~ma~0,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~a,] left hand side expression in assignment: lhs: VariableLHS[~b,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~mb~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~eb~1,] left hand side expression in assignment: lhs: VariableLHS[~mb~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ea~1,] left hand side expression in assignment: lhs: VariableLHS[~accu~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] left hand side expression in assignment: lhs: VariableLHS[~ma~1,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~res~2,] ----Is the binary operator a bitwise operator? true left hand side expression in assignment: lhs: VariableLHS[~__retres10~1,] left hand side expression in assignment: lhs: VariableLHS[~zero~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~b~0,] left hand side expression in assignment: lhs: VariableLHS[~sa~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~sa~0,] left hand side expression in assignment: lhs: VariableLHS[~sb~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~sb~0,] left hand side expression in assignment: lhs: VariableLHS[~r_add~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres23~0,] [2021-01-06 11:33:04,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:33:04,535 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:33:04,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04 WrapperNode [2021-01-06 11:33:04,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:33:04,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:33:04,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:33:04,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:33:04,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:33:04,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:33:04,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:33:04,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:33:04,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (1/1) ... [2021-01-06 11:33:04,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:33:04,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:33:04,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:33:04,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:33:04,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (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 [2021-01-06 11:33:04,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:33:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:33:04,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:33:04,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:33:05,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:33:05,732 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2021-01-06 11:33:05,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:33:05 BoogieIcfgContainer [2021-01-06 11:33:05,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:33:05,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:33:05,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:33:05,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:33:05,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:33:04" (1/3) ... [2021-01-06 11:33:05,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270708f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:33:05, skipping insertion in model container [2021-01-06 11:33:05,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:33:04" (2/3) ... [2021-01-06 11:33:05,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270708f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:33:05, skipping insertion in model container [2021-01-06 11:33:05,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:33:05" (3/3) ... [2021-01-06 11:33:05,744 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2021-01-06 11:33:05,751 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:33:05,757 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2021-01-06 11:33:05,779 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-01-06 11:33:05,809 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:33:05,809 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:33:05,810 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:33:05,810 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:33:05,810 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:33:05,810 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:33:05,810 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:33:05,810 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:33:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2021-01-06 11:33:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 11:33:05,841 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:05,842 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] [2021-01-06 11:33:05,842 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash 46377878, now seen corresponding path program 1 times [2021-01-06 11:33:05,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:05,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741517484] [2021-01-06 11:33:05,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:06,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741517484] [2021-01-06 11:33:06,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:06,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:33:06,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835232412] [2021-01-06 11:33:06,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:33:06,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:06,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:33:06,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:33:06,142 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2021-01-06 11:33:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:06,279 INFO L93 Difference]: Finished difference Result 354 states and 599 transitions. [2021-01-06 11:33:06,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:33:06,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2021-01-06 11:33:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:06,296 INFO L225 Difference]: With dead ends: 354 [2021-01-06 11:33:06,296 INFO L226 Difference]: Without dead ends: 209 [2021-01-06 11:33:06,301 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 [2021-01-06 11:33:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-01-06 11:33:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 190. [2021-01-06 11:33:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2021-01-06 11:33:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 285 transitions. [2021-01-06 11:33:06,361 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 285 transitions. Word has length 24 [2021-01-06 11:33:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:06,365 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 285 transitions. [2021-01-06 11:33:06,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:33:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 285 transitions. [2021-01-06 11:33:06,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 11:33:06,368 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:06,371 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] [2021-01-06 11:33:06,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:33:06,372 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:06,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:06,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1300169336, now seen corresponding path program 1 times [2021-01-06 11:33:06,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:06,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412579096] [2021-01-06 11:33:06,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:06,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412579096] [2021-01-06 11:33:06,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:06,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:33:06,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999606756] [2021-01-06 11:33:06,527 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:33:06,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:06,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:33:06,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:33:06,528 INFO L87 Difference]: Start difference. First operand 190 states and 285 transitions. Second operand 3 states. [2021-01-06 11:33:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:06,558 INFO L93 Difference]: Finished difference Result 326 states and 474 transitions. [2021-01-06 11:33:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:33:06,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2021-01-06 11:33:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:06,562 INFO L225 Difference]: With dead ends: 326 [2021-01-06 11:33:06,562 INFO L226 Difference]: Without dead ends: 284 [2021-01-06 11:33:06,563 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 [2021-01-06 11:33:06,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-01-06 11:33:06,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 266. [2021-01-06 11:33:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2021-01-06 11:33:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 391 transitions. [2021-01-06 11:33:06,588 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 391 transitions. Word has length 26 [2021-01-06 11:33:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:06,589 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 391 transitions. [2021-01-06 11:33:06,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:33:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 391 transitions. [2021-01-06 11:33:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:33:06,592 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:06,592 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] [2021-01-06 11:33:06,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:33:06,592 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:06,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:06,593 INFO L82 PathProgramCache]: Analyzing trace with hash -287005654, now seen corresponding path program 1 times [2021-01-06 11:33:06,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:06,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917570945] [2021-01-06 11:33:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:06,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917570945] [2021-01-06 11:33:06,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:06,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:33:06,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822454133] [2021-01-06 11:33:06,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:33:06,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:33:06,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:33:06,763 INFO L87 Difference]: Start difference. First operand 266 states and 391 transitions. Second operand 4 states. [2021-01-06 11:33:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:06,811 INFO L93 Difference]: Finished difference Result 408 states and 589 transitions. [2021-01-06 11:33:06,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:33:06,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2021-01-06 11:33:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:06,815 INFO L225 Difference]: With dead ends: 408 [2021-01-06 11:33:06,815 INFO L226 Difference]: Without dead ends: 379 [2021-01-06 11:33:06,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2021-01-06 11:33:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 324. [2021-01-06 11:33:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2021-01-06 11:33:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 477 transitions. [2021-01-06 11:33:06,862 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 477 transitions. Word has length 27 [2021-01-06 11:33:06,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:06,867 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 477 transitions. [2021-01-06 11:33:06,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:33:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 477 transitions. [2021-01-06 11:33:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 11:33:06,870 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:06,870 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] [2021-01-06 11:33:06,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:33:06,871 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1566869332, now seen corresponding path program 1 times [2021-01-06 11:33:06,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:06,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103376271] [2021-01-06 11:33:06,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:06,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103376271] [2021-01-06 11:33:06,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:06,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:33:06,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437918796] [2021-01-06 11:33:06,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:33:06,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:06,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:33:06,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:33:06,925 INFO L87 Difference]: Start difference. First operand 324 states and 477 transitions. Second operand 3 states. [2021-01-06 11:33:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:06,943 INFO L93 Difference]: Finished difference Result 337 states and 492 transitions. [2021-01-06 11:33:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:33:06,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2021-01-06 11:33:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:06,947 INFO L225 Difference]: With dead ends: 337 [2021-01-06 11:33:06,947 INFO L226 Difference]: Without dead ends: 333 [2021-01-06 11:33:06,948 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 [2021-01-06 11:33:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-01-06 11:33:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 325. [2021-01-06 11:33:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2021-01-06 11:33:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 478 transitions. [2021-01-06 11:33:06,972 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 478 transitions. Word has length 27 [2021-01-06 11:33:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:06,972 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 478 transitions. [2021-01-06 11:33:06,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:33:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 478 transitions. [2021-01-06 11:33:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 11:33:06,976 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:06,976 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] [2021-01-06 11:33:06,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:33:06,977 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:06,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash -124502666, now seen corresponding path program 1 times [2021-01-06 11:33:06,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:06,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598967900] [2021-01-06 11:33:06,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:07,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598967900] [2021-01-06 11:33:07,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:07,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 11:33:07,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835653250] [2021-01-06 11:33:07,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 11:33:07,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:07,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 11:33:07,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:33:07,196 INFO L87 Difference]: Start difference. First operand 325 states and 478 transitions. Second operand 8 states. [2021-01-06 11:33:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:07,471 INFO L93 Difference]: Finished difference Result 1329 states and 1903 transitions. [2021-01-06 11:33:07,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 11:33:07,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2021-01-06 11:33:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:07,479 INFO L225 Difference]: With dead ends: 1329 [2021-01-06 11:33:07,479 INFO L226 Difference]: Without dead ends: 1116 [2021-01-06 11:33:07,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:33:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2021-01-06 11:33:07,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 455. [2021-01-06 11:33:07,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2021-01-06 11:33:07,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 679 transitions. [2021-01-06 11:33:07,512 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 679 transitions. Word has length 28 [2021-01-06 11:33:07,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:07,512 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 679 transitions. [2021-01-06 11:33:07,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 11:33:07,512 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 679 transitions. [2021-01-06 11:33:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 11:33:07,514 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:07,514 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] [2021-01-06 11:33:07,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:33:07,515 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:07,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:07,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1330541074, now seen corresponding path program 1 times [2021-01-06 11:33:07,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:07,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4896647] [2021-01-06 11:33:07,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:07,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4896647] [2021-01-06 11:33:07,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:07,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:33:07,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166933721] [2021-01-06 11:33:07,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:33:07,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:07,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:33:07,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:33:07,562 INFO L87 Difference]: Start difference. First operand 455 states and 679 transitions. Second operand 4 states. [2021-01-06 11:33:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:07,597 INFO L93 Difference]: Finished difference Result 496 states and 727 transitions. [2021-01-06 11:33:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:33:07,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2021-01-06 11:33:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:07,602 INFO L225 Difference]: With dead ends: 496 [2021-01-06 11:33:07,602 INFO L226 Difference]: Without dead ends: 450 [2021-01-06 11:33:07,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-01-06 11:33:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 387. [2021-01-06 11:33:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2021-01-06 11:33:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 574 transitions. [2021-01-06 11:33:07,619 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 574 transitions. Word has length 30 [2021-01-06 11:33:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:07,620 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 574 transitions. [2021-01-06 11:33:07,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:33:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 574 transitions. [2021-01-06 11:33:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 11:33:07,621 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:07,621 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] [2021-01-06 11:33:07,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:33:07,622 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:07,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:07,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1767634648, now seen corresponding path program 1 times [2021-01-06 11:33:07,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:07,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819411931] [2021-01-06 11:33:07,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:07,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819411931] [2021-01-06 11:33:07,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:07,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:33:07,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232158240] [2021-01-06 11:33:07,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:33:07,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:07,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:33:07,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:33:07,684 INFO L87 Difference]: Start difference. First operand 387 states and 574 transitions. Second operand 4 states. [2021-01-06 11:33:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:07,710 INFO L93 Difference]: Finished difference Result 401 states and 590 transitions. [2021-01-06 11:33:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:33:07,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-06 11:33:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:07,713 INFO L225 Difference]: With dead ends: 401 [2021-01-06 11:33:07,713 INFO L226 Difference]: Without dead ends: 397 [2021-01-06 11:33:07,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-01-06 11:33:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 388. [2021-01-06 11:33:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2021-01-06 11:33:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 575 transitions. [2021-01-06 11:33:07,729 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 575 transitions. Word has length 31 [2021-01-06 11:33:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:07,729 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 575 transitions. [2021-01-06 11:33:07,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:33:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 575 transitions. [2021-01-06 11:33:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 11:33:07,730 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:07,730 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] [2021-01-06 11:33:07,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:33:07,731 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:07,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1824892950, now seen corresponding path program 1 times [2021-01-06 11:33:07,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:07,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941193828] [2021-01-06 11:33:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:07,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941193828] [2021-01-06 11:33:07,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:07,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:33:07,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475424151] [2021-01-06 11:33:07,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:33:07,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:33:07,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:33:07,772 INFO L87 Difference]: Start difference. First operand 388 states and 575 transitions. Second operand 4 states. [2021-01-06 11:33:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:07,813 INFO L93 Difference]: Finished difference Result 392 states and 578 transitions. [2021-01-06 11:33:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:33:07,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-06 11:33:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:07,815 INFO L225 Difference]: With dead ends: 392 [2021-01-06 11:33:07,816 INFO L226 Difference]: Without dead ends: 388 [2021-01-06 11:33:07,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-01-06 11:33:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2021-01-06 11:33:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2021-01-06 11:33:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 571 transitions. [2021-01-06 11:33:07,829 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 571 transitions. Word has length 31 [2021-01-06 11:33:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:07,830 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 571 transitions. [2021-01-06 11:33:07,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:33:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 571 transitions. [2021-01-06 11:33:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 11:33:07,831 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:07,831 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] [2021-01-06 11:33:07,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:33:07,831 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:07,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1372595353, now seen corresponding path program 1 times [2021-01-06 11:33:07,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:07,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792499142] [2021-01-06 11:33:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:07,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792499142] [2021-01-06 11:33:07,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:07,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:33:07,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12960273] [2021-01-06 11:33:07,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:33:07,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:33:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:33:07,942 INFO L87 Difference]: Start difference. First operand 386 states and 571 transitions. Second operand 7 states. [2021-01-06 11:33:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:08,363 INFO L93 Difference]: Finished difference Result 1239 states and 1745 transitions. [2021-01-06 11:33:08,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:33:08,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2021-01-06 11:33:08,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:08,370 INFO L225 Difference]: With dead ends: 1239 [2021-01-06 11:33:08,370 INFO L226 Difference]: Without dead ends: 1044 [2021-01-06 11:33:08,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:33:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2021-01-06 11:33:08,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 553. [2021-01-06 11:33:08,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2021-01-06 11:33:08,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 811 transitions. [2021-01-06 11:33:08,420 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 811 transitions. Word has length 32 [2021-01-06 11:33:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:08,420 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 811 transitions. [2021-01-06 11:33:08,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:33:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 811 transitions. [2021-01-06 11:33:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 11:33:08,422 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:08,422 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] [2021-01-06 11:33:08,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:33:08,423 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:08,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:08,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1765622363, now seen corresponding path program 1 times [2021-01-06 11:33:08,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:08,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520250789] [2021-01-06 11:33:08,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:08,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520250789] [2021-01-06 11:33:08,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:08,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 11:33:08,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355703908] [2021-01-06 11:33:08,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 11:33:08,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:08,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 11:33:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:33:08,540 INFO L87 Difference]: Start difference. First operand 553 states and 811 transitions. Second operand 8 states. [2021-01-06 11:33:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:08,766 INFO L93 Difference]: Finished difference Result 1694 states and 2371 transitions. [2021-01-06 11:33:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 11:33:08,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2021-01-06 11:33:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:08,778 INFO L225 Difference]: With dead ends: 1694 [2021-01-06 11:33:08,778 INFO L226 Difference]: Without dead ends: 1420 [2021-01-06 11:33:08,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:33:08,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2021-01-06 11:33:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 837. [2021-01-06 11:33:08,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2021-01-06 11:33:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1200 transitions. [2021-01-06 11:33:08,830 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1200 transitions. Word has length 32 [2021-01-06 11:33:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:08,830 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 1200 transitions. [2021-01-06 11:33:08,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 11:33:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1200 transitions. [2021-01-06 11:33:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 11:33:08,833 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:08,833 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] [2021-01-06 11:33:08,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:33:08,833 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1942538919, now seen corresponding path program 1 times [2021-01-06 11:33:08,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:08,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147066720] [2021-01-06 11:33:08,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:08,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147066720] [2021-01-06 11:33:08,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:08,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:33:08,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802230064] [2021-01-06 11:33:08,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:33:08,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:08,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:33:08,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:33:08,888 INFO L87 Difference]: Start difference. First operand 837 states and 1200 transitions. Second operand 4 states. [2021-01-06 11:33:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:08,963 INFO L93 Difference]: Finished difference Result 1198 states and 1692 transitions. [2021-01-06 11:33:08,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:33:08,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2021-01-06 11:33:08,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:08,971 INFO L225 Difference]: With dead ends: 1198 [2021-01-06 11:33:08,972 INFO L226 Difference]: Without dead ends: 1125 [2021-01-06 11:33:08,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:08,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2021-01-06 11:33:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 907. [2021-01-06 11:33:09,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2021-01-06 11:33:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1294 transitions. [2021-01-06 11:33:09,022 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1294 transitions. Word has length 32 [2021-01-06 11:33:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:09,022 INFO L481 AbstractCegarLoop]: Abstraction has 907 states and 1294 transitions. [2021-01-06 11:33:09,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:33:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1294 transitions. [2021-01-06 11:33:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 11:33:09,024 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:09,024 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] [2021-01-06 11:33:09,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:33:09,025 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:09,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:09,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2114644955, now seen corresponding path program 1 times [2021-01-06 11:33:09,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:09,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997899859] [2021-01-06 11:33:09,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:09,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997899859] [2021-01-06 11:33:09,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:09,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:33:09,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957631887] [2021-01-06 11:33:09,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:33:09,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:09,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:33:09,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:33:09,076 INFO L87 Difference]: Start difference. First operand 907 states and 1294 transitions. Second operand 3 states. [2021-01-06 11:33:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:09,195 INFO L93 Difference]: Finished difference Result 1814 states and 2585 transitions. [2021-01-06 11:33:09,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:33:09,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2021-01-06 11:33:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:09,201 INFO L225 Difference]: With dead ends: 1814 [2021-01-06 11:33:09,201 INFO L226 Difference]: Without dead ends: 925 [2021-01-06 11:33:09,203 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 [2021-01-06 11:33:09,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2021-01-06 11:33:09,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 919. [2021-01-06 11:33:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2021-01-06 11:33:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1311 transitions. [2021-01-06 11:33:09,249 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1311 transitions. Word has length 32 [2021-01-06 11:33:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:09,249 INFO L481 AbstractCegarLoop]: Abstraction has 919 states and 1311 transitions. [2021-01-06 11:33:09,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:33:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1311 transitions. [2021-01-06 11:33:09,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:33:09,251 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:09,252 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] [2021-01-06 11:33:09,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:33:09,252 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1186694795, now seen corresponding path program 1 times [2021-01-06 11:33:09,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:09,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602079655] [2021-01-06 11:33:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:09,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602079655] [2021-01-06 11:33:09,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:09,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 11:33:09,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904118386] [2021-01-06 11:33:09,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 11:33:09,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:09,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 11:33:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:33:09,400 INFO L87 Difference]: Start difference. First operand 919 states and 1311 transitions. Second operand 9 states. [2021-01-06 11:33:09,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:09,742 INFO L93 Difference]: Finished difference Result 1811 states and 2540 transitions. [2021-01-06 11:33:09,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:33:09,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2021-01-06 11:33:09,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:09,751 INFO L225 Difference]: With dead ends: 1811 [2021-01-06 11:33:09,752 INFO L226 Difference]: Without dead ends: 1514 [2021-01-06 11:33:09,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:33:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2021-01-06 11:33:09,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 972. [2021-01-06 11:33:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2021-01-06 11:33:09,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1384 transitions. [2021-01-06 11:33:09,836 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1384 transitions. Word has length 35 [2021-01-06 11:33:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:09,840 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 1384 transitions. [2021-01-06 11:33:09,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 11:33:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1384 transitions. [2021-01-06 11:33:09,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:33:09,844 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:09,844 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] [2021-01-06 11:33:09,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:33:09,844 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:09,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:09,845 INFO L82 PathProgramCache]: Analyzing trace with hash -401653107, now seen corresponding path program 1 times [2021-01-06 11:33:09,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:09,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246689242] [2021-01-06 11:33:09,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:10,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246689242] [2021-01-06 11:33:10,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:10,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 11:33:10,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257215875] [2021-01-06 11:33:10,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 11:33:10,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:10,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 11:33:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:33:10,035 INFO L87 Difference]: Start difference. First operand 972 states and 1384 transitions. Second operand 9 states. [2021-01-06 11:33:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:10,472 INFO L93 Difference]: Finished difference Result 1726 states and 2389 transitions. [2021-01-06 11:33:10,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 11:33:10,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2021-01-06 11:33:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:10,482 INFO L225 Difference]: With dead ends: 1726 [2021-01-06 11:33:10,482 INFO L226 Difference]: Without dead ends: 1597 [2021-01-06 11:33:10,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2021-01-06 11:33:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2021-01-06 11:33:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1039. [2021-01-06 11:33:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2021-01-06 11:33:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1469 transitions. [2021-01-06 11:33:10,551 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1469 transitions. Word has length 35 [2021-01-06 11:33:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:10,551 INFO L481 AbstractCegarLoop]: Abstraction has 1039 states and 1469 transitions. [2021-01-06 11:33:10,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 11:33:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1469 transitions. [2021-01-06 11:33:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-06 11:33:10,553 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:10,554 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] [2021-01-06 11:33:10,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:33:10,554 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:10,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash -737421815, now seen corresponding path program 1 times [2021-01-06 11:33:10,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:10,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888849425] [2021-01-06 11:33:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:10,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:10,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888849425] [2021-01-06 11:33:10,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:10,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:33:10,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598356416] [2021-01-06 11:33:10,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:33:10,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:10,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:33:10,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:33:10,608 INFO L87 Difference]: Start difference. First operand 1039 states and 1469 transitions. Second operand 4 states. [2021-01-06 11:33:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:10,672 INFO L93 Difference]: Finished difference Result 1052 states and 1483 transitions. [2021-01-06 11:33:10,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:33:10,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2021-01-06 11:33:10,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:10,678 INFO L225 Difference]: With dead ends: 1052 [2021-01-06 11:33:10,678 INFO L226 Difference]: Without dead ends: 985 [2021-01-06 11:33:10,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2021-01-06 11:33:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 985. [2021-01-06 11:33:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2021-01-06 11:33:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1400 transitions. [2021-01-06 11:33:10,723 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1400 transitions. Word has length 35 [2021-01-06 11:33:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:10,723 INFO L481 AbstractCegarLoop]: Abstraction has 985 states and 1400 transitions. [2021-01-06 11:33:10,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:33:10,723 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1400 transitions. [2021-01-06 11:33:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-06 11:33:10,725 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:10,725 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] [2021-01-06 11:33:10,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:33:10,726 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash -311538924, now seen corresponding path program 1 times [2021-01-06 11:33:10,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:10,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832615676] [2021-01-06 11:33:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:10,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832615676] [2021-01-06 11:33:10,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:10,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 11:33:10,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448664504] [2021-01-06 11:33:10,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:33:10,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:10,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:33:10,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:33:10,804 INFO L87 Difference]: Start difference. First operand 985 states and 1400 transitions. Second operand 6 states. [2021-01-06 11:33:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:11,089 INFO L93 Difference]: Finished difference Result 2226 states and 3101 transitions. [2021-01-06 11:33:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:33:11,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2021-01-06 11:33:11,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:11,100 INFO L225 Difference]: With dead ends: 2226 [2021-01-06 11:33:11,100 INFO L226 Difference]: Without dead ends: 1814 [2021-01-06 11:33:11,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:33:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2021-01-06 11:33:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1577. [2021-01-06 11:33:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1577 states. [2021-01-06 11:33:11,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2195 transitions. [2021-01-06 11:33:11,190 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2195 transitions. Word has length 36 [2021-01-06 11:33:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:11,190 INFO L481 AbstractCegarLoop]: Abstraction has 1577 states and 2195 transitions. [2021-01-06 11:33:11,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:33:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2195 transitions. [2021-01-06 11:33:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 11:33:11,193 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:11,193 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] [2021-01-06 11:33:11,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:33:11,193 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:11,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash 322423638, now seen corresponding path program 1 times [2021-01-06 11:33:11,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:11,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554757032] [2021-01-06 11:33:11,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:11,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554757032] [2021-01-06 11:33:11,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:11,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:33:11,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957011559] [2021-01-06 11:33:11,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:33:11,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:11,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:33:11,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:11,252 INFO L87 Difference]: Start difference. First operand 1577 states and 2195 transitions. Second operand 5 states. [2021-01-06 11:33:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:11,587 INFO L93 Difference]: Finished difference Result 1886 states and 2582 transitions. [2021-01-06 11:33:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 11:33:11,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2021-01-06 11:33:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:11,598 INFO L225 Difference]: With dead ends: 1886 [2021-01-06 11:33:11,599 INFO L226 Difference]: Without dead ends: 1862 [2021-01-06 11:33:11,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:33:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2021-01-06 11:33:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1614. [2021-01-06 11:33:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2021-01-06 11:33:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2244 transitions. [2021-01-06 11:33:11,701 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2244 transitions. Word has length 37 [2021-01-06 11:33:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:11,701 INFO L481 AbstractCegarLoop]: Abstraction has 1614 states and 2244 transitions. [2021-01-06 11:33:11,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:33:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2244 transitions. [2021-01-06 11:33:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-06 11:33:11,704 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:11,704 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] [2021-01-06 11:33:11,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:33:11,705 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:11,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1531565480, now seen corresponding path program 1 times [2021-01-06 11:33:11,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:11,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483085681] [2021-01-06 11:33:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:11,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483085681] [2021-01-06 11:33:11,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:11,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 11:33:11,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332075841] [2021-01-06 11:33:11,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 11:33:11,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 11:33:11,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:33:11,857 INFO L87 Difference]: Start difference. First operand 1614 states and 2244 transitions. Second operand 8 states. [2021-01-06 11:33:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:12,556 INFO L93 Difference]: Finished difference Result 2443 states and 3352 transitions. [2021-01-06 11:33:12,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 11:33:12,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2021-01-06 11:33:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:12,570 INFO L225 Difference]: With dead ends: 2443 [2021-01-06 11:33:12,570 INFO L226 Difference]: Without dead ends: 2423 [2021-01-06 11:33:12,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:33:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2021-01-06 11:33:12,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 1885. [2021-01-06 11:33:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2021-01-06 11:33:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2604 transitions. [2021-01-06 11:33:12,710 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2604 transitions. Word has length 37 [2021-01-06 11:33:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:12,710 INFO L481 AbstractCegarLoop]: Abstraction has 1885 states and 2604 transitions. [2021-01-06 11:33:12,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 11:33:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2604 transitions. [2021-01-06 11:33:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 11:33:12,713 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:12,713 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] [2021-01-06 11:33:12,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:33:12,714 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:12,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1581845915, now seen corresponding path program 1 times [2021-01-06 11:33:12,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:12,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453450931] [2021-01-06 11:33:12,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:12,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453450931] [2021-01-06 11:33:12,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:12,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:33:12,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837149238] [2021-01-06 11:33:12,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:33:12,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:12,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:33:12,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:33:12,741 INFO L87 Difference]: Start difference. First operand 1885 states and 2604 transitions. Second operand 3 states. [2021-01-06 11:33:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:13,003 INFO L93 Difference]: Finished difference Result 3761 states and 5164 transitions. [2021-01-06 11:33:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:33:13,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2021-01-06 11:33:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:13,013 INFO L225 Difference]: With dead ends: 3761 [2021-01-06 11:33:13,014 INFO L226 Difference]: Without dead ends: 1879 [2021-01-06 11:33:13,017 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 [2021-01-06 11:33:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2021-01-06 11:33:13,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1314. [2021-01-06 11:33:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2021-01-06 11:33:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1788 transitions. [2021-01-06 11:33:13,122 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1788 transitions. Word has length 38 [2021-01-06 11:33:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:13,122 INFO L481 AbstractCegarLoop]: Abstraction has 1314 states and 1788 transitions. [2021-01-06 11:33:13,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:33:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1788 transitions. [2021-01-06 11:33:13,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 11:33:13,124 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:13,124 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] [2021-01-06 11:33:13,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:33:13,125 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:13,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:13,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1583024832, now seen corresponding path program 1 times [2021-01-06 11:33:13,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:13,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863543222] [2021-01-06 11:33:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:13,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863543222] [2021-01-06 11:33:13,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:13,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:33:13,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821812283] [2021-01-06 11:33:13,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:33:13,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:13,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:33:13,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:33:13,262 INFO L87 Difference]: Start difference. First operand 1314 states and 1788 transitions. Second operand 7 states. [2021-01-06 11:33:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:13,951 INFO L93 Difference]: Finished difference Result 1891 states and 2536 transitions. [2021-01-06 11:33:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:33:13,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2021-01-06 11:33:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:13,962 INFO L225 Difference]: With dead ends: 1891 [2021-01-06 11:33:13,962 INFO L226 Difference]: Without dead ends: 1836 [2021-01-06 11:33:13,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:33:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2021-01-06 11:33:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 1418. [2021-01-06 11:33:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2021-01-06 11:33:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1924 transitions. [2021-01-06 11:33:14,082 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1924 transitions. Word has length 39 [2021-01-06 11:33:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:14,083 INFO L481 AbstractCegarLoop]: Abstraction has 1418 states and 1924 transitions. [2021-01-06 11:33:14,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:33:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1924 transitions. [2021-01-06 11:33:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 11:33:14,085 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:14,085 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] [2021-01-06 11:33:14,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:33:14,086 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:14,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:14,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1498874170, now seen corresponding path program 1 times [2021-01-06 11:33:14,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:14,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273574809] [2021-01-06 11:33:14,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:14,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273574809] [2021-01-06 11:33:14,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:14,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 11:33:14,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093675815] [2021-01-06 11:33:14,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 11:33:14,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:14,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 11:33:14,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-01-06 11:33:14,265 INFO L87 Difference]: Start difference. First operand 1418 states and 1924 transitions. Second operand 10 states. [2021-01-06 11:33:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:15,291 INFO L93 Difference]: Finished difference Result 1815 states and 2371 transitions. [2021-01-06 11:33:15,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 11:33:15,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2021-01-06 11:33:15,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:15,300 INFO L225 Difference]: With dead ends: 1815 [2021-01-06 11:33:15,300 INFO L226 Difference]: Without dead ends: 1693 [2021-01-06 11:33:15,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2021-01-06 11:33:15,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2021-01-06 11:33:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1458. [2021-01-06 11:33:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2021-01-06 11:33:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1960 transitions. [2021-01-06 11:33:15,418 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1960 transitions. Word has length 39 [2021-01-06 11:33:15,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:15,419 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 1960 transitions. [2021-01-06 11:33:15,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 11:33:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1960 transitions. [2021-01-06 11:33:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 11:33:15,420 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:15,421 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] [2021-01-06 11:33:15,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:33:15,421 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash 279654983, now seen corresponding path program 1 times [2021-01-06 11:33:15,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:15,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025985747] [2021-01-06 11:33:15,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:15,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025985747] [2021-01-06 11:33:15,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:15,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 11:33:15,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229585534] [2021-01-06 11:33:15,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 11:33:15,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:15,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 11:33:15,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:33:15,559 INFO L87 Difference]: Start difference. First operand 1458 states and 1960 transitions. Second operand 9 states. [2021-01-06 11:33:16,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:16,165 INFO L93 Difference]: Finished difference Result 3096 states and 4131 transitions. [2021-01-06 11:33:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 11:33:16,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2021-01-06 11:33:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:16,197 INFO L225 Difference]: With dead ends: 3096 [2021-01-06 11:33:16,197 INFO L226 Difference]: Without dead ends: 2502 [2021-01-06 11:33:16,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-01-06 11:33:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2021-01-06 11:33:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1557. [2021-01-06 11:33:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2021-01-06 11:33:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2098 transitions. [2021-01-06 11:33:16,357 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2098 transitions. Word has length 39 [2021-01-06 11:33:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:16,357 INFO L481 AbstractCegarLoop]: Abstraction has 1557 states and 2098 transitions. [2021-01-06 11:33:16,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 11:33:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2098 transitions. [2021-01-06 11:33:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 11:33:16,360 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:16,360 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] [2021-01-06 11:33:16,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:33:16,361 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:16,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:16,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1985041304, now seen corresponding path program 1 times [2021-01-06 11:33:16,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:16,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755242641] [2021-01-06 11:33:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:16,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755242641] [2021-01-06 11:33:16,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:16,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:33:16,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031789102] [2021-01-06 11:33:16,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:33:16,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:33:16,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:33:16,460 INFO L87 Difference]: Start difference. First operand 1557 states and 2098 transitions. Second operand 4 states. [2021-01-06 11:33:16,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:16,861 INFO L93 Difference]: Finished difference Result 3584 states and 4865 transitions. [2021-01-06 11:33:16,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:33:16,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-01-06 11:33:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:16,868 INFO L225 Difference]: With dead ends: 3584 [2021-01-06 11:33:16,869 INFO L226 Difference]: Without dead ends: 2349 [2021-01-06 11:33:16,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:33:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2021-01-06 11:33:17,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 1602. [2021-01-06 11:33:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2021-01-06 11:33:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2158 transitions. [2021-01-06 11:33:17,044 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2158 transitions. Word has length 39 [2021-01-06 11:33:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:17,044 INFO L481 AbstractCegarLoop]: Abstraction has 1602 states and 2158 transitions. [2021-01-06 11:33:17,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:33:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2158 transitions. [2021-01-06 11:33:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 11:33:17,050 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:17,050 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] [2021-01-06 11:33:17,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:33:17,051 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:17,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1417158084, now seen corresponding path program 1 times [2021-01-06 11:33:17,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:17,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796577427] [2021-01-06 11:33:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:17,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796577427] [2021-01-06 11:33:17,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:17,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:33:17,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084581404] [2021-01-06 11:33:17,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:33:17,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:17,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:33:17,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:33:17,095 INFO L87 Difference]: Start difference. First operand 1602 states and 2158 transitions. Second operand 4 states. [2021-01-06 11:33:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:17,246 INFO L93 Difference]: Finished difference Result 1608 states and 2163 transitions. [2021-01-06 11:33:17,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:33:17,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-01-06 11:33:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:17,251 INFO L225 Difference]: With dead ends: 1608 [2021-01-06 11:33:17,251 INFO L226 Difference]: Without dead ends: 1589 [2021-01-06 11:33:17,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:17,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2021-01-06 11:33:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1505. [2021-01-06 11:33:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2021-01-06 11:33:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2032 transitions. [2021-01-06 11:33:17,379 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2032 transitions. Word has length 39 [2021-01-06 11:33:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:17,379 INFO L481 AbstractCegarLoop]: Abstraction has 1505 states and 2032 transitions. [2021-01-06 11:33:17,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:33:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2032 transitions. [2021-01-06 11:33:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 11:33:17,381 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:17,381 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] [2021-01-06 11:33:17,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:33:17,382 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:17,382 INFO L82 PathProgramCache]: Analyzing trace with hash 237582451, now seen corresponding path program 1 times [2021-01-06 11:33:17,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:17,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388784810] [2021-01-06 11:33:17,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:17,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388784810] [2021-01-06 11:33:17,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:17,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:33:17,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855032934] [2021-01-06 11:33:17,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:33:17,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:17,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:33:17,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:33:17,415 INFO L87 Difference]: Start difference. First operand 1505 states and 2032 transitions. Second operand 3 states. [2021-01-06 11:33:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:17,607 INFO L93 Difference]: Finished difference Result 2526 states and 3407 transitions. [2021-01-06 11:33:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:33:17,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 11:33:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:17,612 INFO L225 Difference]: With dead ends: 2526 [2021-01-06 11:33:17,612 INFO L226 Difference]: Without dead ends: 1701 [2021-01-06 11:33:17,614 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 [2021-01-06 11:33:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2021-01-06 11:33:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1486. [2021-01-06 11:33:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2021-01-06 11:33:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1983 transitions. [2021-01-06 11:33:17,731 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 1983 transitions. Word has length 39 [2021-01-06 11:33:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:17,731 INFO L481 AbstractCegarLoop]: Abstraction has 1486 states and 1983 transitions. [2021-01-06 11:33:17,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:33:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 1983 transitions. [2021-01-06 11:33:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 11:33:17,733 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:17,733 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] [2021-01-06 11:33:17,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:33:17,734 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:17,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1412318422, now seen corresponding path program 1 times [2021-01-06 11:33:17,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:17,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513167592] [2021-01-06 11:33:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:17,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513167592] [2021-01-06 11:33:17,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:17,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:33:17,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533102129] [2021-01-06 11:33:17,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:33:17,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:17,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:33:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:33:17,759 INFO L87 Difference]: Start difference. First operand 1486 states and 1983 transitions. Second operand 4 states. [2021-01-06 11:33:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:18,094 INFO L93 Difference]: Finished difference Result 3906 states and 5185 transitions. [2021-01-06 11:33:18,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:33:18,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2021-01-06 11:33:18,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:18,102 INFO L225 Difference]: With dead ends: 3906 [2021-01-06 11:33:18,103 INFO L226 Difference]: Without dead ends: 2839 [2021-01-06 11:33:18,106 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2021-01-06 11:33:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 1491. [2021-01-06 11:33:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1491 states. [2021-01-06 11:33:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 1993 transitions. [2021-01-06 11:33:18,244 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 1993 transitions. Word has length 40 [2021-01-06 11:33:18,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:18,244 INFO L481 AbstractCegarLoop]: Abstraction has 1491 states and 1993 transitions. [2021-01-06 11:33:18,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:33:18,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 1993 transitions. [2021-01-06 11:33:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 11:33:18,247 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:18,247 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] [2021-01-06 11:33:18,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:33:18,247 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:18,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1657461622, now seen corresponding path program 1 times [2021-01-06 11:33:18,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:18,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078491169] [2021-01-06 11:33:18,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:18,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078491169] [2021-01-06 11:33:18,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:18,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:33:18,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635083336] [2021-01-06 11:33:18,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:33:18,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:18,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:33:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:18,293 INFO L87 Difference]: Start difference. First operand 1491 states and 1993 transitions. Second operand 5 states. [2021-01-06 11:33:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:18,559 INFO L93 Difference]: Finished difference Result 1720 states and 2267 transitions. [2021-01-06 11:33:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:33:18,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2021-01-06 11:33:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:18,564 INFO L225 Difference]: With dead ends: 1720 [2021-01-06 11:33:18,564 INFO L226 Difference]: Without dead ends: 1718 [2021-01-06 11:33:18,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:33:18,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2021-01-06 11:33:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1516. [2021-01-06 11:33:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2021-01-06 11:33:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2017 transitions. [2021-01-06 11:33:18,699 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2017 transitions. Word has length 41 [2021-01-06 11:33:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:18,700 INFO L481 AbstractCegarLoop]: Abstraction has 1516 states and 2017 transitions. [2021-01-06 11:33:18,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:33:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2017 transitions. [2021-01-06 11:33:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 11:33:18,702 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:18,702 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] [2021-01-06 11:33:18,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 11:33:18,703 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash 697398146, now seen corresponding path program 1 times [2021-01-06 11:33:18,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:18,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114453046] [2021-01-06 11:33:18,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:18,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114453046] [2021-01-06 11:33:18,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:18,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 11:33:18,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039095030] [2021-01-06 11:33:18,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 11:33:18,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:18,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 11:33:18,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:33:18,890 INFO L87 Difference]: Start difference. First operand 1516 states and 2017 transitions. Second operand 11 states. [2021-01-06 11:33:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:20,062 INFO L93 Difference]: Finished difference Result 2084 states and 2697 transitions. [2021-01-06 11:33:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 11:33:20,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2021-01-06 11:33:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:20,068 INFO L225 Difference]: With dead ends: 2084 [2021-01-06 11:33:20,068 INFO L226 Difference]: Without dead ends: 1827 [2021-01-06 11:33:20,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-01-06 11:33:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2021-01-06 11:33:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1516. [2021-01-06 11:33:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2021-01-06 11:33:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2007 transitions. [2021-01-06 11:33:20,192 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2007 transitions. Word has length 41 [2021-01-06 11:33:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:20,192 INFO L481 AbstractCegarLoop]: Abstraction has 1516 states and 2007 transitions. [2021-01-06 11:33:20,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 11:33:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2007 transitions. [2021-01-06 11:33:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 11:33:20,199 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:20,199 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] [2021-01-06 11:33:20,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:33:20,200 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash -300755169, now seen corresponding path program 1 times [2021-01-06 11:33:20,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:20,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946513841] [2021-01-06 11:33:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:20,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946513841] [2021-01-06 11:33:20,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:20,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:33:20,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861423870] [2021-01-06 11:33:20,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:33:20,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:20,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:33:20,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:33:20,239 INFO L87 Difference]: Start difference. First operand 1516 states and 2007 transitions. Second operand 3 states. [2021-01-06 11:33:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:20,356 INFO L93 Difference]: Finished difference Result 2225 states and 2952 transitions. [2021-01-06 11:33:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:33:20,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2021-01-06 11:33:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:20,361 INFO L225 Difference]: With dead ends: 2225 [2021-01-06 11:33:20,361 INFO L226 Difference]: Without dead ends: 1516 [2021-01-06 11:33:20,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 [2021-01-06 11:33:20,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2021-01-06 11:33:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1516. [2021-01-06 11:33:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2021-01-06 11:33:20,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 1987 transitions. [2021-01-06 11:33:20,493 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 1987 transitions. Word has length 42 [2021-01-06 11:33:20,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:20,493 INFO L481 AbstractCegarLoop]: Abstraction has 1516 states and 1987 transitions. [2021-01-06 11:33:20,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:33:20,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 1987 transitions. [2021-01-06 11:33:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 11:33:20,496 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:20,496 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] [2021-01-06 11:33:20,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 11:33:20,497 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:20,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:20,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1985774487, now seen corresponding path program 1 times [2021-01-06 11:33:20,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:20,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154672202] [2021-01-06 11:33:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:20,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154672202] [2021-01-06 11:33:20,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:20,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 11:33:20,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914245072] [2021-01-06 11:33:20,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 11:33:20,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:20,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 11:33:20,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-06 11:33:20,639 INFO L87 Difference]: Start difference. First operand 1516 states and 1987 transitions. Second operand 10 states. [2021-01-06 11:33:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:21,328 INFO L93 Difference]: Finished difference Result 2334 states and 3004 transitions. [2021-01-06 11:33:21,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 11:33:21,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2021-01-06 11:33:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:21,334 INFO L225 Difference]: With dead ends: 2334 [2021-01-06 11:33:21,335 INFO L226 Difference]: Without dead ends: 2183 [2021-01-06 11:33:21,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2021-01-06 11:33:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2021-01-06 11:33:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1522. [2021-01-06 11:33:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1522 states. [2021-01-06 11:33:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 1991 transitions. [2021-01-06 11:33:21,492 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 1991 transitions. Word has length 42 [2021-01-06 11:33:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:21,492 INFO L481 AbstractCegarLoop]: Abstraction has 1522 states and 1991 transitions. [2021-01-06 11:33:21,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 11:33:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 1991 transitions. [2021-01-06 11:33:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 11:33:21,495 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:21,495 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] [2021-01-06 11:33:21,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 11:33:21,495 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash 720844907, now seen corresponding path program 1 times [2021-01-06 11:33:21,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:21,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679209899] [2021-01-06 11:33:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:21,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679209899] [2021-01-06 11:33:21,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:21,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 11:33:21,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687785481] [2021-01-06 11:33:21,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:33:21,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:33:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:33:21,596 INFO L87 Difference]: Start difference. First operand 1522 states and 1991 transitions. Second operand 6 states. [2021-01-06 11:33:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:21,991 INFO L93 Difference]: Finished difference Result 1986 states and 2576 transitions. [2021-01-06 11:33:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:33:21,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2021-01-06 11:33:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:21,996 INFO L225 Difference]: With dead ends: 1986 [2021-01-06 11:33:21,996 INFO L226 Difference]: Without dead ends: 1906 [2021-01-06 11:33:21,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:33:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2021-01-06 11:33:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1510. [2021-01-06 11:33:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2021-01-06 11:33:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1970 transitions. [2021-01-06 11:33:22,118 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1970 transitions. Word has length 42 [2021-01-06 11:33:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:22,118 INFO L481 AbstractCegarLoop]: Abstraction has 1510 states and 1970 transitions. [2021-01-06 11:33:22,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:33:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1970 transitions. [2021-01-06 11:33:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 11:33:22,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:22,121 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] [2021-01-06 11:33:22,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:33:22,121 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash 236301500, now seen corresponding path program 1 times [2021-01-06 11:33:22,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:22,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171358996] [2021-01-06 11:33:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:22,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171358996] [2021-01-06 11:33:22,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:22,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:33:22,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612136720] [2021-01-06 11:33:22,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:33:22,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:22,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:33:22,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:22,162 INFO L87 Difference]: Start difference. First operand 1510 states and 1970 transitions. Second operand 5 states. [2021-01-06 11:33:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:22,358 INFO L93 Difference]: Finished difference Result 1667 states and 2152 transitions. [2021-01-06 11:33:22,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:33:22,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2021-01-06 11:33:22,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:22,365 INFO L225 Difference]: With dead ends: 1667 [2021-01-06 11:33:22,365 INFO L226 Difference]: Without dead ends: 1665 [2021-01-06 11:33:22,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:33:22,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2021-01-06 11:33:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1496. [2021-01-06 11:33:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2021-01-06 11:33:22,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1952 transitions. [2021-01-06 11:33:22,485 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1952 transitions. Word has length 43 [2021-01-06 11:33:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:22,485 INFO L481 AbstractCegarLoop]: Abstraction has 1496 states and 1952 transitions. [2021-01-06 11:33:22,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:33:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1952 transitions. [2021-01-06 11:33:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:33:22,488 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:22,488 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] [2021-01-06 11:33:22,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:33:22,488 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:22,489 INFO L82 PathProgramCache]: Analyzing trace with hash 481632018, now seen corresponding path program 1 times [2021-01-06 11:33:22,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:22,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698110497] [2021-01-06 11:33:22,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:22,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698110497] [2021-01-06 11:33:22,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:22,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 11:33:22,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143861278] [2021-01-06 11:33:22,545 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:33:22,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:22,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:33:22,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:33:22,546 INFO L87 Difference]: Start difference. First operand 1496 states and 1952 transitions. Second operand 6 states. [2021-01-06 11:33:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:22,732 INFO L93 Difference]: Finished difference Result 1521 states and 1974 transitions. [2021-01-06 11:33:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:33:22,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2021-01-06 11:33:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:22,735 INFO L225 Difference]: With dead ends: 1521 [2021-01-06 11:33:22,735 INFO L226 Difference]: Without dead ends: 1251 [2021-01-06 11:33:22,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:33:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2021-01-06 11:33:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2021-01-06 11:33:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2021-01-06 11:33:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1637 transitions. [2021-01-06 11:33:22,844 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1637 transitions. Word has length 44 [2021-01-06 11:33:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:22,844 INFO L481 AbstractCegarLoop]: Abstraction has 1251 states and 1637 transitions. [2021-01-06 11:33:22,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:33:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1637 transitions. [2021-01-06 11:33:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:33:22,846 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:22,847 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] [2021-01-06 11:33:22,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 11:33:22,847 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1926757168, now seen corresponding path program 1 times [2021-01-06 11:33:22,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:22,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284496251] [2021-01-06 11:33:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:22,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284496251] [2021-01-06 11:33:22,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:22,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:33:22,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077954891] [2021-01-06 11:33:22,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:33:22,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:22,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:33:22,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:33:22,935 INFO L87 Difference]: Start difference. First operand 1251 states and 1637 transitions. Second operand 7 states. [2021-01-06 11:33:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:23,231 INFO L93 Difference]: Finished difference Result 1814 states and 2359 transitions. [2021-01-06 11:33:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:33:23,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2021-01-06 11:33:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:23,235 INFO L225 Difference]: With dead ends: 1814 [2021-01-06 11:33:23,235 INFO L226 Difference]: Without dead ends: 1251 [2021-01-06 11:33:23,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:33:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2021-01-06 11:33:23,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1247. [2021-01-06 11:33:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2021-01-06 11:33:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1629 transitions. [2021-01-06 11:33:23,333 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1629 transitions. Word has length 44 [2021-01-06 11:33:23,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:23,333 INFO L481 AbstractCegarLoop]: Abstraction has 1247 states and 1629 transitions. [2021-01-06 11:33:23,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:33:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1629 transitions. [2021-01-06 11:33:23,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:33:23,335 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:23,335 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] [2021-01-06 11:33:23,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 11:33:23,336 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:23,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:23,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1136587343, now seen corresponding path program 1 times [2021-01-06 11:33:23,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:23,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743524039] [2021-01-06 11:33:23,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:23,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743524039] [2021-01-06 11:33:23,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:23,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 11:33:23,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38213215] [2021-01-06 11:33:23,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 11:33:23,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:23,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 11:33:23,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:33:23,462 INFO L87 Difference]: Start difference. First operand 1247 states and 1629 transitions. Second operand 8 states. [2021-01-06 11:33:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:24,027 INFO L93 Difference]: Finished difference Result 1956 states and 2515 transitions. [2021-01-06 11:33:24,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 11:33:24,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2021-01-06 11:33:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:24,032 INFO L225 Difference]: With dead ends: 1956 [2021-01-06 11:33:24,032 INFO L226 Difference]: Without dead ends: 1874 [2021-01-06 11:33:24,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:33:24,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2021-01-06 11:33:24,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1238. [2021-01-06 11:33:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1238 states. [2021-01-06 11:33:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1612 transitions. [2021-01-06 11:33:24,150 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1612 transitions. Word has length 44 [2021-01-06 11:33:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:24,150 INFO L481 AbstractCegarLoop]: Abstraction has 1238 states and 1612 transitions. [2021-01-06 11:33:24,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 11:33:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1612 transitions. [2021-01-06 11:33:24,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:33:24,153 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:24,153 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] [2021-01-06 11:33:24,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:33:24,153 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:24,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1954235793, now seen corresponding path program 1 times [2021-01-06 11:33:24,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:24,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100637362] [2021-01-06 11:33:24,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:24,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100637362] [2021-01-06 11:33:24,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:24,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 11:33:24,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634775592] [2021-01-06 11:33:24,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 11:33:24,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:24,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 11:33:24,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-01-06 11:33:24,301 INFO L87 Difference]: Start difference. First operand 1238 states and 1612 transitions. Second operand 10 states. [2021-01-06 11:33:24,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:24,629 INFO L93 Difference]: Finished difference Result 1468 states and 1892 transitions. [2021-01-06 11:33:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 11:33:24,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2021-01-06 11:33:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:24,633 INFO L225 Difference]: With dead ends: 1468 [2021-01-06 11:33:24,633 INFO L226 Difference]: Without dead ends: 1344 [2021-01-06 11:33:24,634 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-01-06 11:33:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2021-01-06 11:33:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1235. [2021-01-06 11:33:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2021-01-06 11:33:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1607 transitions. [2021-01-06 11:33:24,750 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1607 transitions. Word has length 44 [2021-01-06 11:33:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:24,751 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1607 transitions. [2021-01-06 11:33:24,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 11:33:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1607 transitions. [2021-01-06 11:33:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:33:24,753 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:24,753 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] [2021-01-06 11:33:24,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:33:24,754 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:24,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:24,754 INFO L82 PathProgramCache]: Analyzing trace with hash 490364254, now seen corresponding path program 1 times [2021-01-06 11:33:24,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:24,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150559200] [2021-01-06 11:33:24,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:24,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150559200] [2021-01-06 11:33:24,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:24,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:33:24,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990504464] [2021-01-06 11:33:24,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:33:24,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:33:24,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:33:24,810 INFO L87 Difference]: Start difference. First operand 1235 states and 1607 transitions. Second operand 7 states. [2021-01-06 11:33:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:25,006 INFO L93 Difference]: Finished difference Result 1344 states and 1740 transitions. [2021-01-06 11:33:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:33:25,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2021-01-06 11:33:25,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:25,008 INFO L225 Difference]: With dead ends: 1344 [2021-01-06 11:33:25,008 INFO L226 Difference]: Without dead ends: 1187 [2021-01-06 11:33:25,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-01-06 11:33:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2021-01-06 11:33:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2021-01-06 11:33:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2021-01-06 11:33:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1543 transitions. [2021-01-06 11:33:25,097 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1543 transitions. Word has length 45 [2021-01-06 11:33:25,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:25,097 INFO L481 AbstractCegarLoop]: Abstraction has 1187 states and 1543 transitions. [2021-01-06 11:33:25,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:33:25,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1543 transitions. [2021-01-06 11:33:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 11:33:25,099 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:25,099 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] [2021-01-06 11:33:25,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 11:33:25,100 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash -127130603, now seen corresponding path program 1 times [2021-01-06 11:33:25,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:25,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988429890] [2021-01-06 11:33:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:25,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988429890] [2021-01-06 11:33:25,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:25,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:33:25,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408776674] [2021-01-06 11:33:25,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:33:25,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:25,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:33:25,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:33:25,233 INFO L87 Difference]: Start difference. First operand 1187 states and 1543 transitions. Second operand 7 states. [2021-01-06 11:33:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:25,812 INFO L93 Difference]: Finished difference Result 1687 states and 2166 transitions. [2021-01-06 11:33:25,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:33:25,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2021-01-06 11:33:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:25,816 INFO L225 Difference]: With dead ends: 1687 [2021-01-06 11:33:25,816 INFO L226 Difference]: Without dead ends: 1621 [2021-01-06 11:33:25,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:33:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2021-01-06 11:33:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1217. [2021-01-06 11:33:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2021-01-06 11:33:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1580 transitions. [2021-01-06 11:33:25,943 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1580 transitions. Word has length 46 [2021-01-06 11:33:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:25,943 INFO L481 AbstractCegarLoop]: Abstraction has 1217 states and 1580 transitions. [2021-01-06 11:33:25,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:33:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1580 transitions. [2021-01-06 11:33:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-01-06 11:33:25,945 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:25,945 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] [2021-01-06 11:33:25,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 11:33:25,946 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:25,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1943409061, now seen corresponding path program 1 times [2021-01-06 11:33:25,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:25,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294284990] [2021-01-06 11:33:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:25,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294284990] [2021-01-06 11:33:25,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:25,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:33:25,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283363990] [2021-01-06 11:33:25,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:33:25,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:25,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:33:25,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:33:25,992 INFO L87 Difference]: Start difference. First operand 1217 states and 1580 transitions. Second operand 5 states. [2021-01-06 11:33:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:26,208 INFO L93 Difference]: Finished difference Result 1311 states and 1681 transitions. [2021-01-06 11:33:26,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:33:26,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2021-01-06 11:33:26,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:26,212 INFO L225 Difference]: With dead ends: 1311 [2021-01-06 11:33:26,212 INFO L226 Difference]: Without dead ends: 1281 [2021-01-06 11:33:26,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:33:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2021-01-06 11:33:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1216. [2021-01-06 11:33:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2021-01-06 11:33:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1572 transitions. [2021-01-06 11:33:26,354 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1572 transitions. Word has length 48 [2021-01-06 11:33:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:26,354 INFO L481 AbstractCegarLoop]: Abstraction has 1216 states and 1572 transitions. [2021-01-06 11:33:26,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:33:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1572 transitions. [2021-01-06 11:33:26,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:33:26,357 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:26,357 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] [2021-01-06 11:33:26,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 11:33:26,358 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:26,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1211782899, now seen corresponding path program 1 times [2021-01-06 11:33:26,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:26,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391058857] [2021-01-06 11:33:26,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:26,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391058857] [2021-01-06 11:33:26,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:26,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:33:26,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973650428] [2021-01-06 11:33:26,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:33:26,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:26,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:33:26,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:33:26,445 INFO L87 Difference]: Start difference. First operand 1216 states and 1572 transitions. Second operand 7 states. [2021-01-06 11:33:26,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:26,985 INFO L93 Difference]: Finished difference Result 2471 states and 3142 transitions. [2021-01-06 11:33:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 11:33:26,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2021-01-06 11:33:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:26,993 INFO L225 Difference]: With dead ends: 2471 [2021-01-06 11:33:26,994 INFO L226 Difference]: Without dead ends: 1706 [2021-01-06 11:33:26,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2021-01-06 11:33:26,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2021-01-06 11:33:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1281. [2021-01-06 11:33:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2021-01-06 11:33:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1627 transitions. [2021-01-06 11:33:27,113 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1627 transitions. Word has length 49 [2021-01-06 11:33:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:27,113 INFO L481 AbstractCegarLoop]: Abstraction has 1281 states and 1627 transitions. [2021-01-06 11:33:27,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:33:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1627 transitions. [2021-01-06 11:33:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:33:27,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:27,116 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] [2021-01-06 11:33:27,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 11:33:27,116 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:27,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1798588913, now seen corresponding path program 1 times [2021-01-06 11:33:27,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:27,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586475117] [2021-01-06 11:33:27,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:27,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586475117] [2021-01-06 11:33:27,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:27,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 11:33:27,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127858654] [2021-01-06 11:33:27,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 11:33:27,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:27,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 11:33:27,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:33:27,231 INFO L87 Difference]: Start difference. First operand 1281 states and 1627 transitions. Second operand 11 states. [2021-01-06 11:33:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:27,822 INFO L93 Difference]: Finished difference Result 2071 states and 2630 transitions. [2021-01-06 11:33:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 11:33:27,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2021-01-06 11:33:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:27,826 INFO L225 Difference]: With dead ends: 2071 [2021-01-06 11:33:27,826 INFO L226 Difference]: Without dead ends: 1503 [2021-01-06 11:33:27,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2021-01-06 11:33:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2021-01-06 11:33:27,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1361. [2021-01-06 11:33:27,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1361 states. [2021-01-06 11:33:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1702 transitions. [2021-01-06 11:33:27,956 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1702 transitions. Word has length 49 [2021-01-06 11:33:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:27,956 INFO L481 AbstractCegarLoop]: Abstraction has 1361 states and 1702 transitions. [2021-01-06 11:33:27,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 11:33:27,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1702 transitions. [2021-01-06 11:33:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:33:27,958 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:27,958 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] [2021-01-06 11:33:27,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 11:33:27,959 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:27,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:27,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1798529331, now seen corresponding path program 1 times [2021-01-06 11:33:27,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:27,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736263609] [2021-01-06 11:33:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:28,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736263609] [2021-01-06 11:33:28,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:28,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 11:33:28,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099965321] [2021-01-06 11:33:28,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 11:33:28,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:28,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 11:33:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:33:28,260 INFO L87 Difference]: Start difference. First operand 1361 states and 1702 transitions. Second operand 12 states. [2021-01-06 11:33:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:29,271 INFO L93 Difference]: Finished difference Result 1535 states and 1876 transitions. [2021-01-06 11:33:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 11:33:29,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2021-01-06 11:33:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:29,275 INFO L225 Difference]: With dead ends: 1535 [2021-01-06 11:33:29,275 INFO L226 Difference]: Without dead ends: 1533 [2021-01-06 11:33:29,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-01-06 11:33:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2021-01-06 11:33:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1368. [2021-01-06 11:33:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2021-01-06 11:33:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1707 transitions. [2021-01-06 11:33:29,401 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1707 transitions. Word has length 49 [2021-01-06 11:33:29,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:29,401 INFO L481 AbstractCegarLoop]: Abstraction has 1368 states and 1707 transitions. [2021-01-06 11:33:29,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 11:33:29,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1707 transitions. [2021-01-06 11:33:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-01-06 11:33:29,404 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:29,404 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] [2021-01-06 11:33:29,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 11:33:29,404 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:29,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1995459394, now seen corresponding path program 1 times [2021-01-06 11:33:29,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:29,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099431602] [2021-01-06 11:33:29,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:29,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099431602] [2021-01-06 11:33:29,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:29,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:33:29,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979963906] [2021-01-06 11:33:29,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:33:29,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:29,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:33:29,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:33:29,501 INFO L87 Difference]: Start difference. First operand 1368 states and 1707 transitions. Second operand 7 states. [2021-01-06 11:33:29,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:29,697 INFO L93 Difference]: Finished difference Result 1405 states and 1741 transitions. [2021-01-06 11:33:29,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:33:29,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2021-01-06 11:33:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:29,701 INFO L225 Difference]: With dead ends: 1405 [2021-01-06 11:33:29,701 INFO L226 Difference]: Without dead ends: 1383 [2021-01-06 11:33:29,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:33:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2021-01-06 11:33:29,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1136. [2021-01-06 11:33:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2021-01-06 11:33:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1416 transitions. [2021-01-06 11:33:29,804 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1416 transitions. Word has length 49 [2021-01-06 11:33:29,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:29,804 INFO L481 AbstractCegarLoop]: Abstraction has 1136 states and 1416 transitions. [2021-01-06 11:33:29,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:33:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1416 transitions. [2021-01-06 11:33:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:33:29,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:29,806 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] [2021-01-06 11:33:29,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 11:33:29,807 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:29,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1809664784, now seen corresponding path program 1 times [2021-01-06 11:33:29,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:29,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974170798] [2021-01-06 11:33:29,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:30,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974170798] [2021-01-06 11:33:30,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:30,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 11:33:30,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85796269] [2021-01-06 11:33:30,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 11:33:30,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:30,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 11:33:30,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:33:30,114 INFO L87 Difference]: Start difference. First operand 1136 states and 1416 transitions. Second operand 12 states. [2021-01-06 11:33:30,709 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2021-01-06 11:33:30,866 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2021-01-06 11:33:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:31,386 INFO L93 Difference]: Finished difference Result 1339 states and 1626 transitions. [2021-01-06 11:33:31,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 11:33:31,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2021-01-06 11:33:31,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:31,390 INFO L225 Difference]: With dead ends: 1339 [2021-01-06 11:33:31,390 INFO L226 Difference]: Without dead ends: 1337 [2021-01-06 11:33:31,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-01-06 11:33:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2021-01-06 11:33:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1138. [2021-01-06 11:33:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2021-01-06 11:33:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1416 transitions. [2021-01-06 11:33:31,496 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1416 transitions. Word has length 51 [2021-01-06 11:33:31,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:31,497 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1416 transitions. [2021-01-06 11:33:31,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 11:33:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1416 transitions. [2021-01-06 11:33:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:33:31,499 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:31,499 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] [2021-01-06 11:33:31,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 11:33:31,499 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:31,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1116701103, now seen corresponding path program 1 times [2021-01-06 11:33:31,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:31,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251911152] [2021-01-06 11:33:31,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:31,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251911152] [2021-01-06 11:33:31,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:31,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 11:33:31,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102098271] [2021-01-06 11:33:31,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 11:33:31,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:31,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 11:33:31,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:33:31,677 INFO L87 Difference]: Start difference. First operand 1138 states and 1416 transitions. Second operand 11 states. [2021-01-06 11:33:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:33,177 INFO L93 Difference]: Finished difference Result 1745 states and 2112 transitions. [2021-01-06 11:33:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 11:33:33,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2021-01-06 11:33:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:33,180 INFO L225 Difference]: With dead ends: 1745 [2021-01-06 11:33:33,180 INFO L226 Difference]: Without dead ends: 1695 [2021-01-06 11:33:33,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2021-01-06 11:33:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2021-01-06 11:33:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1068. [2021-01-06 11:33:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2021-01-06 11:33:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1329 transitions. [2021-01-06 11:33:33,293 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1329 transitions. Word has length 51 [2021-01-06 11:33:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:33,294 INFO L481 AbstractCegarLoop]: Abstraction has 1068 states and 1329 transitions. [2021-01-06 11:33:33,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 11:33:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1329 transitions. [2021-01-06 11:33:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:33:33,295 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:33,295 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] [2021-01-06 11:33:33,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 11:33:33,296 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:33,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:33,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2023683284, now seen corresponding path program 1 times [2021-01-06 11:33:33,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:33,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088270271] [2021-01-06 11:33:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:33,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088270271] [2021-01-06 11:33:33,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:33,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:33:33,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418853256] [2021-01-06 11:33:33,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:33:33,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:33,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:33:33,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:33:33,384 INFO L87 Difference]: Start difference. First operand 1068 states and 1329 transitions. Second operand 7 states. [2021-01-06 11:33:33,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:33,625 INFO L93 Difference]: Finished difference Result 1332 states and 1626 transitions. [2021-01-06 11:33:33,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:33:33,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2021-01-06 11:33:33,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:33,628 INFO L225 Difference]: With dead ends: 1332 [2021-01-06 11:33:33,628 INFO L226 Difference]: Without dead ends: 1250 [2021-01-06 11:33:33,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-01-06 11:33:33,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-01-06 11:33:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 975. [2021-01-06 11:33:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2021-01-06 11:33:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1216 transitions. [2021-01-06 11:33:33,699 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1216 transitions. Word has length 51 [2021-01-06 11:33:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:33,700 INFO L481 AbstractCegarLoop]: Abstraction has 975 states and 1216 transitions. [2021-01-06 11:33:33,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:33:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1216 transitions. [2021-01-06 11:33:33,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:33:33,701 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:33,701 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] [2021-01-06 11:33:33,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 11:33:33,701 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:33,702 INFO L82 PathProgramCache]: Analyzing trace with hash 97389436, now seen corresponding path program 1 times [2021-01-06 11:33:33,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:33,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967738286] [2021-01-06 11:33:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:33,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967738286] [2021-01-06 11:33:33,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:33,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-06 11:33:33,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031650041] [2021-01-06 11:33:33,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 11:33:33,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:33,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 11:33:33,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:33:33,784 INFO L87 Difference]: Start difference. First operand 975 states and 1216 transitions. Second operand 9 states. [2021-01-06 11:33:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:34,439 INFO L93 Difference]: Finished difference Result 2599 states and 3257 transitions. [2021-01-06 11:33:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 11:33:34,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2021-01-06 11:33:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:34,442 INFO L225 Difference]: With dead ends: 2599 [2021-01-06 11:33:34,443 INFO L226 Difference]: Without dead ends: 2469 [2021-01-06 11:33:34,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-01-06 11:33:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2021-01-06 11:33:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 1059. [2021-01-06 11:33:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2021-01-06 11:33:34,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1310 transitions. [2021-01-06 11:33:34,521 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1310 transitions. Word has length 52 [2021-01-06 11:33:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:34,521 INFO L481 AbstractCegarLoop]: Abstraction has 1059 states and 1310 transitions. [2021-01-06 11:33:34,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 11:33:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1310 transitions. [2021-01-06 11:33:34,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:33:34,523 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:34,523 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] [2021-01-06 11:33:34,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 11:33:34,523 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:34,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:34,524 INFO L82 PathProgramCache]: Analyzing trace with hash 777388224, now seen corresponding path program 1 times [2021-01-06 11:33:34,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:34,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272058572] [2021-01-06 11:33:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:34,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272058572] [2021-01-06 11:33:34,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:34,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 11:33:34,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415520564] [2021-01-06 11:33:34,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 11:33:34,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:34,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 11:33:34,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:33:34,587 INFO L87 Difference]: Start difference. First operand 1059 states and 1310 transitions. Second operand 8 states. [2021-01-06 11:33:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:36,327 INFO L93 Difference]: Finished difference Result 6060 states and 7525 transitions. [2021-01-06 11:33:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-06 11:33:36,327 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2021-01-06 11:33:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:36,332 INFO L225 Difference]: With dead ends: 6060 [2021-01-06 11:33:36,332 INFO L226 Difference]: Without dead ends: 5481 [2021-01-06 11:33:36,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2021-01-06 11:33:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2021-01-06 11:33:36,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 1188. [2021-01-06 11:33:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2021-01-06 11:33:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1466 transitions. [2021-01-06 11:33:36,431 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1466 transitions. Word has length 52 [2021-01-06 11:33:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:36,431 INFO L481 AbstractCegarLoop]: Abstraction has 1188 states and 1466 transitions. [2021-01-06 11:33:36,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 11:33:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1466 transitions. [2021-01-06 11:33:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 11:33:36,433 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:36,433 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] [2021-01-06 11:33:36,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 11:33:36,433 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:36,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:36,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1708048898, now seen corresponding path program 1 times [2021-01-06 11:33:36,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:36,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761110189] [2021-01-06 11:33:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:33:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:33:36,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761110189] [2021-01-06 11:33:36,504 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:33:36,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 11:33:36,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840519034] [2021-01-06 11:33:36,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 11:33:36,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:33:36,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 11:33:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:33:36,506 INFO L87 Difference]: Start difference. First operand 1188 states and 1466 transitions. Second operand 8 states. [2021-01-06 11:33:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:33:36,881 INFO L93 Difference]: Finished difference Result 1804 states and 2220 transitions. [2021-01-06 11:33:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 11:33:36,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2021-01-06 11:33:36,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:33:36,884 INFO L225 Difference]: With dead ends: 1804 [2021-01-06 11:33:36,884 INFO L226 Difference]: Without dead ends: 1553 [2021-01-06 11:33:36,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:33:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2021-01-06 11:33:36,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1131. [2021-01-06 11:33:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2021-01-06 11:33:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1391 transitions. [2021-01-06 11:33:36,972 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1391 transitions. Word has length 52 [2021-01-06 11:33:36,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:33:36,972 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1391 transitions. [2021-01-06 11:33:36,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 11:33:36,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1391 transitions. [2021-01-06 11:33:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 11:33:36,974 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:33:36,974 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] [2021-01-06 11:33:36,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 11:33:36,974 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 11:33:36,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:33:36,975 INFO L82 PathProgramCache]: Analyzing trace with hash 160901698, now seen corresponding path program 1 times [2021-01-06 11:33:36,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:33:36,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373923994] [2021-01-06 11:33:36,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:33:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:33:37,001 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:33:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 11:33:37,028 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 11:33:37,061 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 11:33:37,062 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 11:33:37,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 11:33:37,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:33:37 BoogieIcfgContainer [2021-01-06 11:33:37,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 11:33:37,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 11:33:37,146 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 11:33:37,147 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 11:33:37,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:33:05" (3/4) ... [2021-01-06 11:33:37,151 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-01-06 11:33:37,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 11:33:37,153 INFO L168 Benchmark]: Toolchain (without parser) took 33010.56 ms. Allocated memory was 151.0 MB in the beginning and 563.1 MB in the end (delta: 412.1 MB). Free memory was 125.6 MB in the beginning and 235.1 MB in the end (delta: -109.5 MB). Peak memory consumption was 303.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:37,154 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.3 MB in the end (delta: 436.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:33:37,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.20 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 111.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:37,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.89 ms. Allocated memory is still 151.0 MB. Free memory was 111.1 MB in the beginning and 108.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:37,155 INFO L168 Benchmark]: Boogie Preprocessor took 98.30 ms. Allocated memory is still 151.0 MB. Free memory was 108.1 MB in the beginning and 105.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:37,155 INFO L168 Benchmark]: RCFGBuilder took 1003.05 ms. Allocated memory is still 151.0 MB. Free memory was 105.7 MB in the beginning and 91.9 MB in the end (delta: 13.8 MB). Peak memory consumption was 12.9 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:37,156 INFO L168 Benchmark]: TraceAbstraction took 31408.81 ms. Allocated memory was 151.0 MB in the beginning and 563.1 MB in the end (delta: 412.1 MB). Free memory was 91.4 MB in the beginning and 235.1 MB in the end (delta: -143.7 MB). Peak memory consumption was 269.4 MB. Max. memory is 8.0 GB. [2021-01-06 11:33:37,156 INFO L168 Benchmark]: Witness Printer took 5.09 ms. Allocated memory is still 563.1 MB. Free memory is still 235.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 11:33:37,159 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.18 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.3 MB in the end (delta: 436.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 393.20 ms. Allocated memory is still 151.0 MB. Free memory was 125.4 MB in the beginning and 111.3 MB in the end (delta: 14.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 89.89 ms. Allocated memory is still 151.0 MB. Free memory was 111.1 MB in the beginning and 108.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 98.30 ms. Allocated memory is still 151.0 MB. Free memory was 108.1 MB in the beginning and 105.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1003.05 ms. Allocated memory is still 151.0 MB. Free memory was 105.7 MB in the beginning and 91.9 MB in the end (delta: 13.8 MB). Peak memory consumption was 12.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 31408.81 ms. Allocated memory was 151.0 MB in the beginning and 563.1 MB in the end (delta: 412.1 MB). Free memory was 91.4 MB in the beginning and 235.1 MB in the end (delta: -143.7 MB). Peak memory consumption was 269.4 MB. Max. memory is 8.0 GB. * Witness Printer took 5.09 ms. Allocated memory is still 563.1 MB. Free memory is still 235.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 9]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 68. Possible FailurePath: [L218] unsigned int a ; [L219] unsigned int ma = __VERIFIER_nondet_uint(); [L220] signed char ea = __VERIFIER_nondet_char(); [L221] unsigned int b ; [L222] unsigned int mb = __VERIFIER_nondet_uint(); [L223] signed char eb = __VERIFIER_nondet_char(); [L224] unsigned int r_add ; [L225] unsigned int zero ; [L226] int sa ; [L227] int sb ; [L228] int tmp ; [L229] int tmp___0 ; [L230] int tmp___1 ; [L231] int tmp___2 ; [L232] int tmp___3 ; [L233] int tmp___4 ; [L234] int tmp___5 ; [L235] int tmp___6 ; [L236] int tmp___7 ; [L237] int tmp___8 ; [L238] int tmp___9 ; [L239] int __retres23 ; [L17] unsigned int res ; [L18] unsigned int __retres4 ; [L21] COND TRUE ! m [L22] __retres4 = 0U [L72] return (__retres4); [L243] zero = base2flt(0, 0) [L17] unsigned int res ; [L18] unsigned int __retres4 ; [L21] COND FALSE !(! m) [L27] COND FALSE !(m < 1U << 24U) [L49] COND TRUE 1 [L51] COND TRUE m >= 1U << 25U [L56] COND TRUE e >= 127 [L57] __retres4 = 4294967295U [L72] return (__retres4); [L244] a = base2flt(ma, ea) [L17] unsigned int res ; [L18] unsigned int __retres4 ; [L21] COND FALSE !(! m) [L27] COND FALSE !(m < 1U << 24U) [L49] COND TRUE 1 [L51] COND FALSE !(m >= 1U << 25U) [L68] m = m & ~ (1U << 24U) [L69] res = m | ((unsigned int )(e + 128) << 24U) VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L70] __retres4 = res VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L72] return (__retres4); VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L245] b = base2flt(mb, eb) [L247] COND FALSE !(a < zero) VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L250] COND TRUE a > zero [L251] tmp = 1 VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L255] sa = tmp VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L257] COND FALSE !(b < zero) VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L260] COND TRUE b > zero [L261] tmp___0 = 1 VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L265] sb = tmp___0 VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L76] unsigned int res ; [L77] unsigned int ma ; [L78] unsigned int mb ; [L79] unsigned int delta ; [L80] int ea ; [L81] int eb ; [L82] unsigned int tmp ; [L83] unsigned int __retres10 ; VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L86] COND FALSE !(a < b) VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L93] COND FALSE !(! b) VAL [res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L100] ma = a & ((1U << 24U) - 1U) VAL [ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L101] ea = (int )(a >> 24U) - 128 VAL [ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L102] ma = ma | (1U << 24U) VAL [ma = a & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L103] mb = b & ((1U << 24U) - 1U) VAL [ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L104] eb = (int )(b >> 24U) - 128 VAL [ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L105] mb = mb | (1U << 24U) VAL [ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L8] COND TRUE !(cond) VAL [ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] [L9] reach_error() VAL [ma = a & ((1U << 24U) - 1U)=16777215, mb = b & ((1U << 24U) - 1U)=16777215, res = m | ((unsigned int )(e + 128) << 24U)=50331648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.2s, OverallIterations: 50, TraceHistogramMax: 1, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12359 SDtfs, 22662 SDslu, 42181 SDs, 0 SdLazy, 6984 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 119 SyntacticMatches, 23 SemanticMatches, 448 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1885occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 49 MinimizatonAttempts, 19975 StatesRemovedByMinimization, 45 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 2004 NumberOfCodeBlocks, 2004 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1901 ConstructedInterpolants, 0 QuantifiedInterpolants, 278121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 49 InterpolantComputations, 49 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...